{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:49Z","timestamp":1772163949889,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,12]],"date-time":"2011-02-12T00:00:00Z","timestamp":1297468800000},"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,2,12]]},"DOI":"10.1145\/1941553.1941577","type":"proceedings-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T13:31:03Z","timestamp":1297776663000},"page":"157-168","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Communicating memory transactions"],"prefix":"10.1145","author":[{"given":"Mohsen","family":"Lesani","sequence":"first","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,2,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328897.1328449"},{"key":"e_1_3_2_1_2_1","volume-title":"MIT Press","author":"Agha A. ACTORS","year":"1986"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294278"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03869-3_35"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_14"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796808006916"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of TRANSACT'09","author":"Dudnik P."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411222"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/573304"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345233"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/949343.949340"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167495"},{"key":"e_1_3_2_1_14_1","volume-title":"Grossman D. Programming Idioms for Transactional Events. PLACES","author":"Kehrt M.","year":"2009"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706304"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/358818.358824"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941577"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/361227.361234"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/42392.42399"},{"key":"e_1_3_2_1_20_1","volume-title":"Transaction Synchronizers. In Proc. of SCOOL'05","author":"Luchangco V."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1808954.1808967"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941578"},{"key":"e_1_3_2_1_23_1","volume-title":"Olukotun K. STAMP: Stanford Transactional Applications for Multi-Processing. In Proc. of IISWC '08","author":"Minh C. C."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328448"},{"key":"e_1_3_2_1_25_1","unstructured":"Odersky M. The Scala Language Specification. 2010. Programming Methods Laboratory. EPFL.  Odersky M. The Scala Language Specification. 2010. Programming Methods Laboratory. EPFL."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Reppy J. H. 1999 Concurrent Programming in ML. Cambridge University Press.   Reppy J. H. 1999 Concurrent Programming in ML. Cambridge University Press.","DOI":"10.1017\/CBO9780511574962"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of TRANSACT'06","author":"Scott M. L."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297027.1297042"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.10"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159822"}],"event":{"name":"PPoPP '11: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"San Antonio TX USA","acronym":"PPoPP '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 16th ACM symposium on Principles and practice of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1941553.1941577","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1941553.1941577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:59:36Z","timestamp":1750229976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1941553.1941577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,12]]},"references-count":30,"alternative-id":["10.1145\/1941553.1941577","10.1145\/1941553"],"URL":"https:\/\/doi.org\/10.1145\/1941553.1941577","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2038037.1941577","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,2,12]]},"assertion":[{"value":"2011-02-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}