{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T01:53:56Z","timestamp":1787882036606,"version":"build-2784847793"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T00:00:00Z","timestamp":1383004800000},"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,10,29]]},"DOI":"10.1145\/2509136.2509514","type":"proceedings-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T11:29:17Z","timestamp":1382527757000},"page":"131-150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["CDSchecker"],"prefix":"10.1145","author":[{"given":"Brian","family":"Norris","sequence":"first","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brian","family":"Demsky","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/stackoverflow.com\/questions\/8115267\/writing-a-spinning-thread-barrier-using-c11-atomics. Oct. 2012.  http:\/\/stackoverflow.com\/questions\/8115267\/writing-a-spinning-thread-barrier-using-c11-atomics. Oct. 2012."},{"key":"e_1_3_2_1_2_1","unstructured":"ISO\/IEC 9899:2011 Information technology - programming languages - C.  ISO\/IEC 9899:2011 Information technology - programming languages - C."},{"key":"e_1_3_2_1_3_1","unstructured":"ISO\/IEC 14882:2011 Information technology - programming languages - C++.  ISO\/IEC 14882:2011 Information technology - programming languages - C++."},{"key":"e_1_3_2_1_4_1","unstructured":"http:\/\/www.justsoftwaresolutions.co.uk\/threading\/. Dec. 2012.  http:\/\/www.justsoftwaresolutions.co.uk\/threading\/. Dec. 2012."},{"key":"e_1_3_2_1_5_1","unstructured":"http:\/\/cbloomrants.blogspot.com\/2011\/07\/07-18-11-mcs-list-based-lock_18.html. Oct. 2012.  http:\/\/cbloomrants.blogspot.com\/2011\/07\/07-18-11-mcs-list-based-lock_18.html. Oct. 2012."},{"key":"e_1_3_2_1_6_1","unstructured":"http:\/\/cbloomrants.blogspot.com\/2011\/07\/07-30-11-look-at-some-bounded-queues.html. Oct. 2012.  http:\/\/cbloomrants.blogspot.com\/2011\/07\/07-30-11-look-at-some-bounded-queues.html. Oct. 2012."},{"key":"e_1_3_2_1_7_1","unstructured":"https:\/\/groups.google.com\/forum\/#!msg\/comp.programming.threads\/nSSFT9vKEe0\/7eD3ioDg6nEJ. Oct. 2012.  https:\/\/groups.google.com\/forum\/#!msg\/comp.programming.threads\/nSSFT9vKEe0\/7eD3ioDg6nEJ. Oct. 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926394"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429099"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2003476.2003493"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247684.2247688"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375591"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806634"},{"key":"e_1_3_2_1_14_1","unstructured":"C. Click. A lock-free hash table. http:\/\/www.azulsystems.com\/events\/javaone_2007\/2007_LockFreeHash.pdf May 2007.  C. Click. A lock-free hash table. http:\/\/www.azulsystems.com\/events\/javaone_2007\/2007_LockFreeHash.pdf May 2007."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1512475.1512478"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250762"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945468"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806625"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/547238"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263717"},{"key":"e_1_3_2_1_23_1","volume-title":"The SPIN Model Checker: Primer and Reference Manual","author":"Holzmann G. J.","year":"2003","unstructured":"G. J. Holzmann . The SPIN Model Checker: Primer and Reference Manual . Addison-Wesley Professional , 1 st edition, 2003 . G. J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley Professional, 1st edition, 2003.","edition":"1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11813040_32"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1556444.1556453"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the Conference on Formal Methods in Computer-Aided Design","author":"Kuperstein M.","year":"2010","unstructured":"M. Kuperstein , M. Vechev , and E. Yahav . Automatic inference of memory fences . In Proceedings of the Conference on Formal Methods in Computer-Aided Design , 2010 . M. Kuperstein, M. Vechev, and E. Yahav. Automatic inference of memory fences. In Proceedings of the Conference on Formal Methods in Computer-Aided Design, 2010."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993521"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442524"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1815987"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993522"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/106972.106999"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 8th Symposium on Operating Systems Design and Implementation","author":"Musuvathi M.","year":"2008","unstructured":"M. Musuvathi , S. Qadeer , P. A. Nainar , T. Ball , G. Basler , and I. Neamtiu . Finding and reproducing Heisenbugs in concurrent programs . In Proceedings of the 8th Symposium on Operating Systems Design and Implementation , 2008 . M. Musuvathi, S. Qadeer, P. A. Nainar, T. Ball, G. Basler, and I. Neamtiu. Finding and reproducing Heisenbugs in concurrent programs. In Proceedings of the 8th Symposium on Operating Systems Design and Implementation, 2008."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.752664"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_1_37_1","unstructured":"D. Vyukov. Relacy race detector. http:\/\/relacy.sourceforge.net\/ 2011 Oct.  D. Vyukov. Relacy race detector. http:\/\/relacy.sourceforge.net\/ 2011 Oct."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88387-6_11"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85114-1_20"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02652-2_22"}],"event":{"name":"SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Indianapolis Indiana USA","acronym":"SPLASH '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509136.2509514","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2509136.2509514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:34Z","timestamp":1750217314000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509136.2509514"}},"subtitle":["checking concurrent data structures written with C\/C++ atomics"],"short-title":[],"issued":{"date-parts":[[2013,10,29]]},"references-count":40,"alternative-id":["10.1145\/2509136.2509514","10.1145\/2509136"],"URL":"https:\/\/doi.org\/10.1145\/2509136.2509514","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544173.2509514","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,10,29]]},"assertion":[{"value":"2013-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}