{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:47Z","timestamp":1763468327220,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T00:00:00Z","timestamp":1499731200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1218017, CCF-1150036, CCF-1218188, CCF-1314633"],"award-info":[{"award-number":["CCF-1218017, CCF-1150036, CCF-1218188, CCF-1314633"]}],"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":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935801","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T11:03:00Z","timestamp":1467975780000},"page":"83-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs"],"prefix":"10.1145","author":[{"given":"Robert","family":"Utterback","sequence":"first","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}]},{"given":"Kunal","family":"Agrawal","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]},{"given":"I-Ting Angelina","family":"Lee","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, St. Louis, MO, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/2612669.2612688"},{"key":"e_1_3_2_1_2_1","first-page":"721","volume-title":"ICPP '87","author":"Todd","year":"1987","unstructured":"Todd R. Allen and David A. Padua. Debugging fortran on a shared memory machine. ICPP '87, pages 721--727, aug 1987."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.5555\/645928.672546"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/647912.740822"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1007912.1007933"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/324133.324234"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/2093157.2093165"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/115372.115324"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/28395.28434"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/800070.802184"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1250734.1250762"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/68210.69224"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/945445.945468"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/258492.258493"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1542476.1542490"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1016\/0022-0000(93)90040-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/277650.277725"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.5555\/313559.313676"},{"key":"e_1_3_2_1_19_1","volume-title":"http:\/\/cilkplus.github.io\/","author":"Intel Corporation","year":"2013","unstructured":"Intel Corporation. CilkPlus\/LLVM. http:\/\/cilkplus.github.io\/, 2013."},{"key":"e_1_3_2_1_20_1","first-page":"324396","article-title":"Intel\u00ae Cilk\u2122 Plus Language Extension Specification","volume":"2","author":"Intel Corporation","year":"2013","unstructured":"Intel Corporation. Intel\u00ae Cilk\u2122 Plus Language Extension Specification, Version 1.2, September 2013. Document 324396-003US.","journal-title":"Version 1"},{"key":"e_1_3_2_1_21_1","volume-title":"November","author":"Intel Corporation","year":"2013","unstructured":"Intel Corporation. An introduction to the cilk screen race detector., November 2013."},{"key":"e_1_3_2_1_22_1","volume-title":"WoDet '13","author":"Ji Weixing","year":"2013","unstructured":"Weixing Ji, Li Lu, and Michael L. Scott. Tardis: Task-level access race detection by intersecting sets. WoDet '13, Houston, TX, USA, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/2486159.2486174"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/2594291.2594300"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1065010.1065034"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/125826.125861"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/174266.171370"},{"key":"e_1_3_2_1_28_1","first-page":"109","volume-title":"In Advances in Languages and Compilers for Parallel Computing, 1990 Workshop","author":"Netzer Robert","year":"1989","unstructured":"Robert Netzer and Barton P. Miller. Detecting data races in parallel program executions. In In Advances in Languages and Compilers for Parallel Computing, 1990 Workshop, pages 109--129. MIT Press, 1989."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/130616.130623"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1002\/cpe.v19:3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.5555\/1939399.1939430"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/2254064.2254127"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/268998.266641"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/2755573.2755603"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1145\/1791194.1791203"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1145\/2442516.2442554"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1145\/322154.322161"},{"key":"e_1_3_2_1_38_1","volume-title":"November","author":"Plus Development Team Intel Cilk","year":"2011","unstructured":"Intel Cilk Plus Development Team. Intrinsics for Low Overhead Tool Annotations. Technical report, November 2011."}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"acronym":"SPAA '16","name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Pacific Grove California USA"},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935801","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935801","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:44:10Z","timestamp":1763459050000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":38,"alternative-id":["10.1145\/2935764.2935801","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935801","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}