{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T05:55:49Z","timestamp":1781762149615,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T00:00:00Z","timestamp":1296000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,1,26]]},"DOI":"10.1145\/1926385.1926447","type":"proceedings-article","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T09:58:22Z","timestamp":1295863102000},"page":"535-548","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":65,"title":["Safe nondeterminism in a deterministic-by-default parallel language"],"prefix":"10.1145","author":[{"suffix":"Jr.","given":"Robert L.","family":"Bocchino","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Heumann","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nima","family":"Honarmand","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sarita V.","family":"Adve","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vikram S.","family":"Adve","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam","family":"Welc","sequence":"additional","affiliation":[{"name":"Adobe Systems, San Francisco, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tatiana","family":"Shpeisman","sequence":"additional","affiliation":[{"name":"Intel Labs, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,1,26]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"http:\/\/iss.ices.utexas.edu\/lonestar\/.  http:\/\/iss.ices.utexas.edu\/lonestar\/."},{"key":"e_1_3_2_2_2_1","unstructured":"http:\/\/gee.cs.oswego.edu\/dl\/concurrency-interest.  http:\/\/gee.cs.oswego.edu\/dl\/concurrency-interest."},{"key":"e_1_3_2_2_3_1","unstructured":"http:\/\/http:\/\/sites.google.com\/site\/deucestm.  http:\/\/http:\/\/sites.google.com\/site\/deucestm."},{"key":"e_1_3_2_2_4_1","volume-title":"http:\/\/www.openmp.org\/mp-documents\/spec30.pdf","author":"Application Program Interface MP","year":"2008","unstructured":"Open MP Application Program Interface , Version 3.0. http:\/\/www.openmp.org\/mp-documents\/spec30.pdf , 2008 . OpenMP Application Program Interface, Version 3.0. http:\/\/www.openmp.org\/mp-documents\/spec30.pdf, 2008."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119479.1119480"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328449"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504203"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133985"},{"key":"e_1_3_2_2_9_1","volume-title":"LCPC","author":"Afek Y.","year":"2010","unstructured":"Y. Afek Lowering STM overhead with static analysis . In LCPC , 2010 . Y. Afek et al. Lowering STM overhead with static analysis. In LCPC, 2010."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504190"},{"key":"e_1_3_2_2_11_1","volume-title":"Efficient system-enforced deterministic parallelism","author":"Aviram A.","year":"2010","unstructured":"A. Aviram Efficient system-enforced deterministic parallelism . 2010 . A. Aviram et al. Efficient system-enforced deterministic parallelism. 2010."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449783"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562154.1562156"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736029"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640096"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209958"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640097"},{"key":"e_1_3_2_2_18_1","volume-title":"HotPar","author":"Bocchino R. L.","year":"2009","unstructured":"R. L. Bocchino Parallel programming must be deterministic by default . In HotPar , 2009 . R. L. Bocchino et al. Parallel programming must be deterministic by default. In HotPar, 2009."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/582419.582440"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760267.1760273"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480909"},{"key":"e_1_3_2_2_23_1","volume-title":"CPC","author":"Budimlic Z.","year":"2009","unstructured":"Z. Budimlic Multi-core implementations of the concurrent collections programming model . In CPC , 2009 . Z. Budimlic et al. Multi-core implementations of the concurrent collections programming model. In CPC, 2009."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869515"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/191080.191147"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161150"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508255"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377492.1377495"},{"key":"e_1_3_2_2_30_1","volume-title":"Intel White Paper","author":"Ghuloum A.","year":"2007","unstructured":"A. Ghuloum : A flexible parallel programming model for tera-scale architectures . Intel White Paper , 2007 . A. Ghuloum et al. Ct: A flexible parallel programming model for tera-scale architectures. Intel White Paper, 2007."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133984"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/949305.949340"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452044.1452045"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869514"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1207012"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.180"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640095"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2006.18"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869511"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328448"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508256"},{"key":"e_1_3_2_2_44_1","volume-title":"Computer Science Press","author":"Papadimitriou C.","year":"1986","unstructured":"C. Papadimitriou . The theory of database concurrency control. Computer Science Press , Inc ., 1986 . C. Papadimitriou. The theory of database concurrency control. Computer Science Press, Inc., 1986."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/291889.291893"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449779"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250744"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1229428.1229443"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094845"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/1152692.1152695"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378582"}],"event":{"name":"POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Austin Texas USA","acronym":"POPL '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926447","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1926385.1926447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:59:51Z","timestamp":1750229991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":50,"alternative-id":["10.1145\/1926385.1926447","10.1145\/1926385"],"URL":"https:\/\/doi.org\/10.1145\/1926385.1926447","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1925844.1926447","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,1,26]]},"assertion":[{"value":"2011-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}