{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:43:59Z","timestamp":1775054639336,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,12]],"date-time":"2011-11-12T00:00:00Z","timestamp":1321056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","award":["24894"],"award-info":[{"award-number":["24894"]}],"id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004318","name":"Microsoft","doi-asserted-by":"publisher","award":["24263"],"award-info":[{"award-number":["24263"]}],"id":[{"id":"10.13039\/100004318","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0720906CCF-0747390CCF-1018729CCF-1018730"],"award-info":[{"award-number":["CNS-0720906CCF-0747390CCF-1018729CCF-1018730"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005595","name":"University of California","doi-asserted-by":"publisher","award":["DIG07-10227"],"award-info":[{"award-number":["DIG07-10227"]}],"id":[{"id":"10.13039\/100005595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CNS-0720906CCF-0747390CCF-1018729CCF-1018730"],"award-info":[{"award-number":["CNS-0720906CCF-0747390CCF-1018729CCF-1018730"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,11,12]]},"DOI":"10.1145\/2063384.2063452","type":"proceedings-article","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T13:32:09Z","timestamp":1320759129000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Efficient data race detection for distributed memory parallel programs"],"prefix":"10.1145","author":[{"given":"Chang-Seo","family":"Park","sequence":"first","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koushik","family":"Sen","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Hargrove","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costin","family":"Iancu","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,11,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/115952.115976"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101908.1101944"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268974"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147403.1147412"},{"key":"e_1_3_2_1_5_1","volume-title":"Parallel and Distributed Systems: Testing and Debugging 2005 (PADTAD'05)","author":"Bensalem S.","year":"2005","unstructured":"S. Bensalem and K. Havelund . Scalable dynamic deadlock analysis of multi-threaded programs . In Parallel and Distributed Systems: Testing and Debugging 2005 (PADTAD'05) , 2005 . S. Bensalem and K. Havelund. Scalable dynamic deadlock analysis of multi-threaded programs. In Parallel and Distributed Systems: Testing and Debugging 2005 (PADTAD'05), 2005."},{"key":"e_1_3_2_1_6_1","unstructured":"Berkeley UPC. Available at http:\/\/upc.lbl.gov\/.  Berkeley UPC. Available at http:\/\/upc.lbl.gov\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250737"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001436"},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to UPC and language specification","author":"Carlson W. W.","year":"1999","unstructured":"W. W. Carlson , J. M. Draper , D. E. Culler , K. Yelick , and K. W. E. Brooks . Introduction to UPC and language specification , 1999 . W. W. Carlson, J. M. Draper, D. E. Culler, K. Yelick, and K. W. E. Brooks. Introduction to UPC and language specification, 1999."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512560"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115324"},{"key":"e_1_3_2_1_12_1","first-page":"15","volume-title":"JavaTM Virtual Machine Research and Technology Symposium","author":"Christiaens M.","year":"2001","unstructured":"M. Christiaens and K. D. Bosschere . TRaDe, a topological approach to on-the-fly race detection in java programs . In JavaTM Virtual Machine Research and Technology Symposium , pages 15 -- 15 . USENIX, 2001 . M. Christiaens and K. D. Bosschere. TRaDe, a topological approach to on-the-fly race detection in java programs. In JavaTM Virtual Machine Research and Technology Symposium, pages 15--15. USENIX, 2001."},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"1994","unstructured":"T. Cormen , C. Leiserson , and R. Rivset . Introduction to Algorithms . The MIT Press , 1994 . T. Cormen, C. Leiserson, and R. Rivset. Introduction to Algorithms. The MIT Press, 1994."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145319.1145342"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1787275.1787323"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/122759.122767"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:FORM.0000040028.49845.67"},{"key":"e_1_3_2_1_18_1","volume-title":"Model checking","author":"Clarke J. E. M.","year":"1999","unstructured":"J. E. M. Clarke , O. Grumberg , and D. A. Peled . Model checking . MIT Press , 1999 . J. E. M. Clarke, O. Grumberg, and D. A. Peled. Model checking. MIT Press, 1999."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_21"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964023"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375618"},{"key":"e_1_3_2_1_25_1","unstructured":"Franklin: Cray XT4. At http:\/\/www.nersc.gov\/users\/computational-systems\/franklin\/.  Franklin: Cray XT4. At http:\/\/www.nersc.gov\/users\/computational-systems\/franklin\/."},{"key":"e_1_3_2_1_26_1","first-page":"153","volume-title":"Workshop on Algorithms and Data Structures","author":"Hanson E. N.","year":"1992","unstructured":"E. N. Hanson and T. Johnson . The interval skip list: A data structure for finding all intervals that overlap a point . In Workshop on Algorithms and Data Structures , pages 153 -- 164 . Springer , 1992 . E. N. Hanson and T. Johnson. The interval skip list: A data structure for finding all intervals that overlap a point. In Workshop on Algorithms and Data Structures, pages 153--164. Springer, 1992."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/645880.672085"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050043"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/996893.996844"},{"key":"e_1_3_2_1_30_1","volume-title":"USA","author":"Hilfinger P. N.","year":"2001","unstructured":"P. N. Hilfinger , D. Bonachea , D. Gay , S. Graham , B. Liblit , G. Pike , and K. Yelick . Titanium language reference manual. Technical report, Berkeley, CA , USA , 2001 . P. N. Hilfinger, D. Bonachea, D. Gay, S. Graham, B. Liblit, G. Pike, and K. Yelick. Titanium language reference manual. Technical report, Berkeley, CA, USA, 2001."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.588521"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882302"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_54"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542489"},{"key":"e_1_3_2_1_35_1","volume-title":"Mini-Symposium Tools Support for Parallel Programming","author":"Krammer B.","year":"2005","unstructured":"B. Krammer , M. M\u00fcller , and M. Resch . Runtime checking of MPI applications with MARMOT . In Mini-Symposium Tools Support for Parallel Programming , ParCo 2005 , Malaga, Spain, September 12 - 16, 2005., 2005. B. Krammer, M. M\u00fcller, and M. Resch. Runtime checking of MPI applications with MARMOT. In Mini-Symposium Tools Support for Parallel Programming, ParCo 2005, Malaga, Spain, September 12 - 16, 2005., 2005."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168917.1168864"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/125826.125861"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250785"},{"key":"e_1_3_2_1_40_1","first-page":"267","volume-title":"Operating Systems Design and Implementation (OSDI)","author":"Musuvathi M.","year":"2008","unstructured":"M. Musuvathi , S. Qadeer , T. Ball , G. Basler , P. A. Nainar , and I. Neamtiu . Finding and reproducing heisenbugs in concurrent programs . In Operating Systems Design and Implementation (OSDI) , pages 267 -- 280 , 2008 . M. Musuvathi, S. Qadeer, T. Ball, G. Basler, P. A. Nainar, and I. Neamtiu. Finding and reproducing heisenbugs in concurrent programs. In Operating Systems Design and Implementation (OSDI), pages 267--280, 2008."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250738"},{"key":"e_1_3_2_1_43_1","unstructured":"The NAS Parallel Benchmarks. Available at http:\/\/www.nas.nasa.gov\/Software\/NPB.  The NAS Parallel Benchmarks. Available at http:\/\/www.nas.nasa.gov\/Software\/NPB."},{"key":"e_1_3_2_1_44_1","unstructured":"The UPC NAS Parallel Benchmarks. Available at http:\/\/upc.gwu.edu\/download.html.  The UPC NAS Parallel Benchmarks. Available at http:\/\/upc.gwu.edu\/download.html."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89247-2_7"},{"key":"e_1_3_2_1_46_1","first-page":"127","volume-title":"Virtual Machine Research and Technology Symposium","author":"Nishiyama H.","year":"2004","unstructured":"H. Nishiyama . Detecting data races using dynamic escape analysis based on read barrier . In Virtual Machine Research and Technology Symposium , pages 127 -- 138 , 2004 . H. Nishiyama. Detecting data races using dynamic escape analysis based on read barrier. In Virtual Machine Research and Technology Symposium, pages 127--138, 2004."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781528"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.19"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453101.1453121"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508249"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996845"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/312203.312214"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/73141.74844"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375584"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.01.006"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941603"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345258"},{"key":"e_1_3_2_1_60_1","volume-title":"SC '00","author":"Vetter J. S.","year":"2000","unstructured":"J. S. Vetter and B. R. de Supinski . Dynamic software testing of MPI applications with Umpire. In Supercomputing , SC '00 , Washington, DC, USA , 2000 . IEEE Computer Society. J. S. Vetter and B. R. de Supinski. Dynamic software testing of MPI applications with Umpire. In Supercomputing, SC '00, Washington, DC, USA, 2000. IEEE Computer Society."},{"key":"e_1_3_2_1_61_1","volume-title":"Automated Software Engineering (ASE)","author":"Visser W.","year":"2000","unstructured":"W. Visser , K. Havelund , G. Brat , and S. Park . Model checking programs . In Automated Software Engineering (ASE) . IEEE , 2000 . W. Visser, K. Havelund, G. Brat, and S. Park. Model checking programs. In Automated Software Engineering (ASE). IEEE, 2000."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.7"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/504282.504288"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)81049-1"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1122993"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/11531142_26"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065013"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85114-1_20"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639622.1639630"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229472"}],"event":{"name":"SC '11: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Seattle Washington","acronym":"SC '11","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"]},"container-title":["Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063384.2063452","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063384.2063452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:07Z","timestamp":1750241167000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063384.2063452"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,12]]},"references-count":70,"alternative-id":["10.1145\/2063384.2063452","10.1145\/2063384"],"URL":"https:\/\/doi.org\/10.1145\/2063384.2063452","relation":{},"subject":[],"published":{"date-parts":[[2011,11,12]]},"assertion":[{"value":"2011-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}