{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:44:08Z","timestamp":1780994648426,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806596.1806634","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T08:37:34Z","timestamp":1275986254000},"page":"330-340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":95,"title":["Line-up"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Burckhardt","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Dern","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madanlal","family":"Musuvathi","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roy","family":"Tan","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90224-P"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250737"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_12"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_44"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693458"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007945"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480885"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.02.003"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065015"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542490"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375618"},{"key":"e_1_3_2_1_13_1","unstructured":"K. Fraser. Practical Lock-Freedom. PhD thesis University of Cambridge 2004.  K. Fraser. Practical Lock-Freedom. PhD thesis University of Cambridge 2004."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233307.1233309"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542491"},{"key":"e_1_3_2_1_19_1","volume-title":"November","author":"MSDN","year":"2007","unstructured":"MSDN , http:\/\/blogs.msdn.com\/somasegar\/archive\/2007\/11\/29\/parallel-extensions-to-the-net-fx-ctp.aspx. Parallel Extensions to the .NET FX CTP , November 2007 . MSDN, http:\/\/blogs.msdn.com\/somasegar\/archive\/2007\/11\/29\/parallel-extensions-to-the-net-fx-ctp.aspx. Parallel Extensions to the .NET FX CTP, November 2007."},{"key":"e_1_3_2_1_20_1","volume-title":"November","author":"MSDN","year":"2009","unstructured":"MSDN , http:\/\/msdn.microsoft.com\/en-us\/library\/dd460718(VS.100).aspx. .NET Framework 4 Data Structures for Parallel Programming , November 2009 . MSDN, http:\/\/msdn.microsoft.com\/en-us\/library\/dd460718(VS.100).aspx. .NET Framework 4 Data Structures for Parallel Programming, November 2009."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375625"},{"key":"e_1_3_2_1_22_1","first-page":"267","volume-title":"Operating Systems Design and Impl. (OSDI)","author":"Musuvathi M.","year":"2008","unstructured":"M. Musuvathi , S. Qadeer , T. Ball , G. Basler , P. Nainar , and I. Neamtiu . Finding and reproducing heisenbugs in concurrent programs . In Operating Systems Design and Impl. (OSDI) , pages 267 -- 280 , 2008 . M. Musuvathi, S. Qadeer, T. Ball, G. Basler, P. Nainar, and I. Neamtiu. Finding and reproducing heisenbugs in concurrent programs. In Operating Systems Design and Impl. (OSDI), pages 267--280, 2008."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/265924.265927"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_27"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1122992"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02652-2_21"}],"event":{"name":"PLDI '10: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Toronto Ontario Canada","acronym":"PLDI '10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806596.1806634","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806596.1806634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:22:31Z","timestamp":1750231351000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806596.1806634"}},"subtitle":["a complete and automatic linearizability checker"],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":26,"alternative-id":["10.1145\/1806596.1806634","10.1145\/1806596"],"URL":"https:\/\/doi.org\/10.1145\/1806596.1806634","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1809028.1806634","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}