{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:10:12Z","timestamp":1775873412764,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2491956.2462184","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T12:03:50Z","timestamp":1370952230000},"page":"321-332","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":65,"title":["P"],"prefix":"10.1145","author":[{"given":"Ankush","family":"Desai","sequence":"first","affiliation":[{"name":"Microsoft Corporation, Bangalore, India"}]},{"given":"Vivek","family":"Gupta","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}]},{"given":"Ethan","family":"Jackson","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}]},{"given":"Shaz","family":"Qadeer","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}]},{"given":"Sriram","family":"Rajamani","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Bangalore, India"}]},{"given":"Damien","family":"Zufferey","sequence":"additional","affiliation":[{"name":"IST Austria, Klosterneuburg, Austria"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"289","volume-title":"USENIX Annual Technical Conference, General Track","author":"Adya A.","year":"2002","unstructured":"A. Adya , J. Howell , M. Theimer , W. J. Bolosky , and J. R. Douceur . Cooperative task management without manual stack management . In USENIX Annual Technical Conference, General Track , pages 289 -- 302 , 2002 . A. Adya, J. Howell, M. Theimer, W. J. Bolosky, and J. R. Douceur. Cooperative task management without manual stack management. In USENIX Annual Technical Conference, General Track, pages 289--302, 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27813-9_42"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(91)90001-E"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(92)90005-V"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.798322"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926432"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781169"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237805"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263717"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.97300"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90035-9"},{"key":"e_1_3_2_1_12_1","unstructured":"D.\n      Harel\n     and \n      H.\n      Kugler\n  . \n  The Rhapsody semantics of Statecharts (or on the executable core of the UML) - preliminary version\n  . In H. Ehrig W. Damm J. Desel M. Gro\u00dfe-Rhode W. Reif E. Schnieder and E. Westk\u00e4mper editors SoftSpez Final Report volume \n  3147\n   of \n  Lecture Notes in Computer Science pages \n  325\n  --\n  354\n  . \n  Springer 2004\n  .  D. Harel and H. Kugler. The Rhapsody semantics of Statecharts (or on the executable core of the UML) - preliminary version. In H. Ehrig W. Damm J. Desel M. Gro\u00dfe-Rhode W. Reif E. Schnieder and E. Westk\u00e4mper editors SoftSpez Final Report volume 3147 of Lecture Notes in Computer Science pages 325--354. Springer 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1624775.1624804"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359585"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/512976.512985"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"Milner R.","year":"1980","unstructured":"R. Milner . A Calculus of Communicating Systems , volume 92 of Lecture Notes in Computer Science . Springer , 1980 . R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer, 1980."},{"key":"e_1_3_2_1_17_1","first-page":"267","volume-title":"OSDI : USENIX Symposium on Operating Systems Design and Implementation","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 OSDI : USENIX Symposium on Operating Systems Design and Implementation , 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 OSDI : USENIX Symposium on Operating Systems Design and Implementation, pages 267--280, 2008."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_1_19_1","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell S.","year":"2009","unstructured":"S. Russell and P. Norvig . Artificial Intelligence: A Modern Approach ( 3 rd edition). Prentice Hall , 2009 . S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach (3rd edition). Prentice Hall, 2009.","edition":"3"}],"event":{"name":"PLDI '13: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Seattle Washington USA","acronym":"PLDI '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491956.2462184","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491956.2462184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:41Z","timestamp":1750217321000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491956.2462184"}},"subtitle":["safe asynchronous event-driven programming"],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":19,"alternative-id":["10.1145\/2491956.2462184","10.1145\/2491956"],"URL":"https:\/\/doi.org\/10.1145\/2491956.2462184","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2499370.2462184","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}