{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:51Z","timestamp":1750306491925,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,28]],"date-time":"2015-09-28T00:00:00Z","timestamp":1443398400000},"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":[[2015,9,28]]},"DOI":"10.1145\/2811681.2811694","type":"proceedings-article","created":{"date-parts":[[2015,11,5]],"date-time":"2015-11-05T20:49:20Z","timestamp":1446756560000},"page":"64-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Using \"must\" and \"may\" summaries to detect data races in Java bytecode that does not rely on the synchronized construct"],"prefix":"10.1145","author":[{"given":"David A. W.","family":"Clarke","sequence":"first","affiliation":[{"name":"Dept. of Computing and Inf. Systems, University of Melbourne, Melbourne, Australia, +61 408 793 793"}]},{"given":"Tim","family":"Miller","sequence":"additional","affiliation":[{"name":"Dept. of Computing and Inf. Systems, University of Melbourne, Melbourne, Australia"}]},{"given":"Antonette","family":"Mendoza","sequence":"additional","affiliation":[{"name":"Dept. of Computing and Inf. Systems, University of Melbourne, Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2015,9,28]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Disruptor: High performance alternative to bounded queues for exchanging data between concurrent threads.\" from http:\/\/lmax-exchange.github.io\/disruptor\/files\/Disruptor-1.0.pdf","author":"Thompson M.","year":"2011","unstructured":"Thompson , M. , ( 2011 ). \" Disruptor: High performance alternative to bounded queues for exchanging data between concurrent threads.\" from http:\/\/lmax-exchange.github.io\/disruptor\/files\/Disruptor-1.0.pdf . Thompson, M., et al. (2011). \"Disruptor: High performance alternative to bounded queues for exchanging data between concurrent threads.\" from http:\/\/lmax-exchange.github.io\/disruptor\/files\/Disruptor-1.0.pdf."},{"key":"e_1_3_2_1_2_1","volume-title":"Ad Hoc Synchronization Considered Harmful. OSDI","author":"Xiong W.","year":"2010","unstructured":"Xiong , W. , ( 2010 ). Ad Hoc Synchronization Considered Harmful. OSDI . Xiong, W., et al. (2010). Ad Hoc Synchronization Considered Harmful. OSDI."},{"key":"e_1_3_2_1_3_1","volume-title":"Effectively Recognize Ad hoc Synchronizations with Static Analysis. LCPC","author":"Yin L.","year":"2014","unstructured":"Yin , L. ( 2014 ). Effectively Recognize Ad hoc Synchronizations with Static Analysis. LCPC , Springer International Publishing . Yin, L. (2014). Effectively Recognize Ad hoc Synchronizations with Static Analysis. LCPC, Springer International Publishing."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688501"},{"key":"e_1_3_2_1_5_1","volume-title":"ASM: a code manipulation tool to implement adaptable systems.\" Adaptable and extensible component systems 30","author":"Bruneton E.","year":"2002","unstructured":"Bruneton , E. , ( 2002 ). \" ASM: a code manipulation tool to implement adaptable systems.\" Adaptable and extensible component systems 30 . Bruneton, E., et al. (2002). \"ASM: a code manipulation tool to implement adaptable systems.\" Adaptable and extensible component systems 30."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/320385.320386"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2008.130"},{"key":"e_1_3_2_1_8_1","volume-title":"Keshmesh: Bringing Advanced Static Analysis to Concurrency Bug Pattern Detectors","author":"Vakilian M.","year":"2013","unstructured":"Vakilian , M. , ( 2013 ). \" Keshmesh: Bringing Advanced Static Analysis to Concurrency Bug Pattern Detectors .\" Vakilian, M., et al. (2013). \"Keshmesh: Bringing Advanced Static Analysis to Concurrency Bug Pattern Detectors.\""},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134018"}],"event":{"name":"ASWEC ' 15 Vol. II: ASWEC 2015 24th Australasian Software Engineering Conference","sponsor":["Australian Comp Soc Australian Computer Society"],"location":"Adelaide SA Australia","acronym":"ASWEC ' 15 Vol. II"},"container-title":["Proceedings of the ASWEC 2015 24th Australasian Software Engineering Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2811681.2811694","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2811681.2811694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:38Z","timestamp":1750225718000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2811681.2811694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,28]]},"references-count":9,"alternative-id":["10.1145\/2811681.2811694","10.1145\/2811681"],"URL":"https:\/\/doi.org\/10.1145\/2811681.2811694","relation":{},"subject":[],"published":{"date-parts":[[2015,9,28]]},"assertion":[{"value":"2015-09-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}