{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:24Z","timestamp":1750306104139,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T00:00:00Z","timestamp":1503273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004739","name":"Youth Innovation Promotion Association of the Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["2017151"],"award-info":[{"award-number":["2017151"]}],"id":[{"id":"10.13039\/501100004739","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502465, 61472318, 61632015"],"award-info":[{"award-number":["61502465, 61472318, 61632015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National 973 program of China","award":["2014CB340702"],"award-info":[{"award-number":["2014CB340702"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1522883"],"award-info":[{"award-number":["DGE-1522883"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,21]]},"DOI":"10.1145\/3106237.3106242","type":"proceedings-article","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T19:36:18Z","timestamp":1501702578000},"page":"315-325","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["AtexRace: across thread and execution sampling for in-house race detection"],"prefix":"10.1145","author":[{"given":"Yu","family":"Guo","sequence":"first","affiliation":[{"name":"Western Michigan University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Cai","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijiang","family":"Yang","sequence":"additional","affiliation":[{"name":"Western Michigan University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320418"},{"key":"e_1_3_2_1_2_1","volume-title":"Thesis: Benchmarking modern multiprocessors","author":"Bienia C.","year":"2011","unstructured":"C. Bienia . Ph. D. Thesis: Benchmarking modern multiprocessors . Princeton University , January 2011 . C. Bienia. Ph.D. Thesis: Benchmarking modern multiprocessors. Princeton University, January 2011."},{"key":"e_1_3_2_1_3_1","first-page":"21","article-title":"Lightweight data race detection for production runs","volume":"11","author":"Biswas S.","year":"2017","unstructured":"S. Biswas , M. Cao , M. Zhang , M.D. Bond , and B.P. Wook . Lightweight data race detection for production runs . In Proc. CC , 11 - 21 , 2017 . S. Biswas, M. Cao, M. Zhang, M.D. Bond, and B.P. Wook. Lightweight data race detection for production runs. In Proc. CC, 11 -21,2017.","journal-title":"Proc. CC"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814292"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390650"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806626"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065972"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736040"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786839"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2011.12"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950310"},{"key":"e_1_3_2_1_13_1","first-page":"305","volume-title":"Proc. PLDI","author":"Dimitro D.","year":"2014","unstructured":"D. Dimitro , V. Raychev , M. Vechev , and E. Koskinen . Commutativity race detection . In Proc. PLDI , 305 - 315 , 2014 . D. Dimitro, V. Raychev, M. Vechev, and E. Koskinen. Commutativity race detection. In Proc. PLDI, 305-315, 2014."},{"key":"e_1_3_2_1_14_1","first-page":"1","volume-title":"Proc. OSDI","author":"Erickson J.","year":"2010","unstructured":"J. Erickson , M. Musuvathi , S. Burckhardt and K. Olynyk . Effective data-race detection for the kernel . In Proc. OSDI , 1 - 6 , 2010 . J. Erickson, M. Musuvathi, S. Burckhardt and K. Olynyk. Effective data-race detection for the kernel. In Proc. OSDI, 1-6, 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555263"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806672.1806674"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336779"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2014.17"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594330"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594315"},{"key":"e_1_3_2_1_23_1","volume-title":"May 21","author":"Jackson J.","year":"2012","unstructured":"J. Jackson . Nasdaq's Facebook glitch came from 'race conditions ', May 21 2012 . http:\/\/www.computerworld.com\/article\/2504676\/financial-it\/nasdaq-s-facebook-glitch-came-from--race-conditions-.html, last visited on March 2016. J. Jackson. Nasdaq's Facebook glitch came from 'race conditions', May 21 2012. http:\/\/www.computerworld.com\/article\/2504676\/financial-it\/nasdaq-s-facebook-glitch-came-from--race-conditions-.html, last visited on March 2016."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869481"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770351.1770386"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522736"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_28_1","first-page":"177","volume-title":"Proc. RV","author":"Letko Z.","year":"2011","unstructured":"Z. Letko , T. Vojnar , and B. K'rena . Coverage metrics for saturation-based and search-based testing of concurrent software . In Proc. RV , 177 - 192 , 2011 . Z. Letko, T. Vojnar, and B. K'rena. Coverage metrics for saturation-based and search-based testing of concurrent software. In Proc. RV, 177-192, 2011."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1993.274940"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346323"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2451116.2451121"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594311"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542491"},{"key":"e_1_3_2_1_35_1","volume-title":"Proc. OSDI, 267-280","author":"Musuvathi M.","year":"2008","unstructured":"M. Musuvathi , S. Qadeer , T. Ball , G. Basier , P. A. Nainar , and I. Neamtiu . Finding and reproducing heisenbugs in concurrent programs . In Proc. OSDI, 267-280 2008 . M. Musuvathi, S. Qadeer, T. Ball, G. Basier, P. A. Nainar, and I. Neamtiu. Finding and reproducing heisenbugs in concurrent programs. In Proc. OSDI, 267-280 2008."},{"key":"e_1_3_2_1_36_1","first-page":"2012","article-title":"Multicore acceleration of priority-based schedulers for concurrency bug detection","volume":"543","author":"Nagarakatte S.","year":"2012","unstructured":"S. Nagarakatte , S. Burckhardt , M. M.K. Martin , and M. Musuvathi . Multicore acceleration of priority-based schedulers for concurrency bug detection . In Proc. PLDI , 2012 , 543-554 , 2012 . S. Nagarakatte, S. Burckhardt, M. M.K. Martin, and M. Musuvathi. Multicore acceleration of priority-based schedulers for concurrency bug detection. In Proc. PLDI, 2012, 543-554, 2012.","journal-title":"Proc. PLDI"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250738"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063452"},{"key":"e_1_3_2_1_40_1","unstructured":"K. Poulsen. Software bug contributed to blackout. http:\/\/www.securityfocus.com\/news\/8016 Feb. 2004. K. Poulsen. Software bug contributed to blackout. http:\/\/www.securityfocus.com\/news\/8016 Feb. 2004."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/781498.781529","volume-title":"Proc. PPoPP","author":"Pozniansky E.","year":"2003","unstructured":"E. Pozniansky and A. Schuster . Efficient on-the-fly data race detection in multithreaded C++ programs . In Proc. PPoPP , 179 - 190 , 2003 . E. Pozniansky and A. Schuster. Efficient on-the-fly data race detection in multithreaded C++ programs. In Proc. PPoPP, 179-190, 2003."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134019"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2803209"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375584"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1791194.1791203"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103702"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882300"},{"key":"e_1_3_2_1_49_1","unstructured":"Microsoft. Thread execution blocks. http:\/\/msdn.microsoft.com\/enus\/library\/ms686708.aspx Microsoft. Thread execution blocks. http:\/\/msdn.microsoft.com\/enus\/library\/ms686708.aspx"},{"key":"e_1_3_2_1_50_1","first-page":"434","volume-title":"Proc. CAV","author":"Vineet K.","year":"2010","unstructured":"K. Vineet and C. Wang . Universal causality graphs: a precise happens-before model for detecting bugs in concurrent programs . In Proc. CAV , 434 - 449 , 2010 . K. Vineet and C. Wang. Universal causality graphs: a precise happens-before model for detecting bugs in concurrent programs. In Proc. CAV, 434-449, 2010."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287654"},{"key":"e_1_3_2_1_52_1","first-page":"376","volume-title":"Hoang. Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability. In Proc. VMCAI","author":"Wang C.","year":"2014","unstructured":"C. Wang , K. Hoang. Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability. In Proc. VMCAI , 376 - 394 , 2014 . C. Wang, K. Hoang. Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability. In Proc. VMCAI, 376-394, 2014."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985824"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/2190025.2190068"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384651"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095832"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568294"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336780"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2451116.2451129"}],"event":{"name":"ESEC\/FSE'17: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Paderborn Germany","acronym":"ESEC\/FSE'17"},"container-title":["Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106242","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106237.3106242","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106237.3106242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:36Z","timestamp":1750217436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,21]]},"references-count":59,"alternative-id":["10.1145\/3106237.3106242","10.1145\/3106237"],"URL":"https:\/\/doi.org\/10.1145\/3106237.3106242","relation":{},"subject":[],"published":{"date-parts":[[2017,8,21]]},"assertion":[{"value":"2017-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}