{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:02Z","timestamp":1750307342731,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T00:00:00Z","timestamp":1311120000000},"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,7,20]]},"DOI":"10.1145\/2003476.2003493","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T12:34:54Z","timestamp":1311165294000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Nitpicking c++ concurrency"],"prefix":"10.1145","author":[{"given":"Jasmin Christian","family":"Blanchette","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}]},{"given":"Tjark","family":"Weber","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Mark","family":"Batty","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Scott","family":"Owens","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Susmit","family":"Sarkar","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2011,7,20]]},"reference":[{"volume-title":"Technical Report N3290, ISO IEC JTC1\/SC22\/WG21","year":"2011","author":"Programming","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"P. B.\n       \n      Andrews\n    .\n      \n  \n   \n  An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof\n   (\n  2\n  nd Ed.) volume \n  27\n   of \n  Applied Logic\n  . \n  Springer 2002\n  .   P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof (2nd Ed.) volume 27 of Applied Logic. Springer 2002.","DOI":"10.1007\/978-94-015-9934-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926394"},{"key":"e_1_3_2_1_5_1","unstructured":"J. C. Blanchette. Relational analysis of (co)inductive predicates (co)inductive datatypes and (co)recursive functions. Softw. Qual. J. To appear.  J. C. Blanchette. Relational analysis of (co)inductive predicates (co)inductive datatypes and (co)recursive functions. Softw. Qual. J. To appear."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14052-5_11"},{"key":"e_1_3_2_1_7_1","series-title":"LNCS","first-page":"331","volume-title":"R. De Nicola","author":"Cenciarelli P.","year":"2007"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/2266170"},{"key":"e_1_3_2_1_9_1","unstructured":"W.-P.\n       \n      de Roever F.\n       \n      de Boer U.\n       \n      Hannemann J.\n       \n      Hooman Y.\n       \n      Lakhnech M.\n       \n      Poel and \n      \n      \n      J.\n       \n      Zwiers\n      \n  \n  . \n  Concurrency Verification: Introduction to Compositional and Noncompositional Methods volume \n  54\n   of \n  Cambridge Tracts in Theoretical Computer Science\n  . \n  Cambridge University Press 2001\n  .  W.-P. de Roever F. de Boer U. Hannemann J. Hooman Y. Lakhnech M. Poel and J. Zwiers. Concurrency Verification: Introduction to Compositional and Noncompositional Methods volume 54 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"N.\n       \n      E\u00e9n\n     and \n      \n      \n      N.\n       \n      S\u00f6rensson\n      \n  \n  . \n  An extensible SAT-solver. In E. Giunchiglia and A. Tacchella editors SAT\n   \n  2003 volume \n  2919\n   of \n  LNCS pages \n  502\n  --\n  518\n  . \n  Springer 2004.  N. E\u00e9n and N. S\u00f6rensson. An extensible SAT-solver. In E. Giunchiglia and A. Tacchella editors SAT 2003 volume 2919 of LNCS pages 502--518. Springer 2004.","DOI":"10.1007\/978-3-540-24605-3_37"},{"volume-title":"Cambridge University Press","year":"1993","author":"Gordon M. J. C.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"M. J. C.\n       \n      Gordon R.\n       \n      Milner and \n      \n      \n      C. P.\n       \n      Wadsworth\n      \n  \n  . \n  Edinburgh LCF: A Mechanised Logic of Computation volume \n  78\n   of \n  LNCS\n  . \n  Springer 1979\n  .  M. J. C. Gordon R. Milner and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation volume 78 of LNCS. Springer 1979.","DOI":"10.1007\/3-540-09724-4"},{"volume-title":"MIT Press","year":"2006","author":"Jackson D.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03459-6_11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2009.82"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081740"},{"volume-title":"Gelato Conference","year":"2005","author":"Lameter C.","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_23"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040336"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11591191_37"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"A. C.\n       \n      Melo\n     and \n      \n      \n      S. C.\n       \n      Chagas\n      \n  \n  . \n  Visual-MCM: Visualising execution histories on multiple memory consistency models. In P. Zinterhof M. Vajtersic and A. Uhl editors ACPC\n   \n  1999 volume \n  1557\n   of \n  LNCS pages \n  500\n  --\n  509\n  . \n  Springer 1999.   A. C. Melo and S. C. Chagas. Visual-MCM: Visualising execution histories on multiple memory consistency models. In P. Zinterhof M. Vajtersic and A. Uhl editors ACPC 1999 volume 1557 of LNCS pages 500--509. Springer 1999.","DOI":"10.1007\/3-540-49164-3_48"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"T.\n       \n      Nipkow L. C.\n       \n      Paulson and \n      \n      \n      M.\n       \n      Wenzel\n      \n  \n  . \n  Isabelle\/HOL: A Proof Assistant for Higher-Order Logic volume \n  2283\n   of \n  LNCS\n  . \n  Springer 2002\n  .   T. Nipkow L. C. Paulson and M. Wenzel. Isabelle\/HOL: A Proof Assistant for Higher-Order Logic volume 2283 of LNCS. Springer 2002.","DOI":"10.1007\/3-540-45949-9"},{"volume-title":"ITP","year":"2011","author":"Owens S.","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/1096-9128(200005)12:6<445::AID-CPE484>3.0.CO;2-A"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480929"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70592-5_3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"E.\n       \n      Torlak\n     and \n      \n      \n      D.\n       \n      Jackson\n      \n  \n  . \n  Kodkod: A relational model finder. In O. Grumberg and M. Huth editors TACAS\n   \n  2007 volume \n  4424\n   of \n  LNCS pages \n  632\n  --\n  647\n  . \n  Springer 2007.   E. Torlak and D. Jackson. Kodkod: A relational model finder. In O. Grumberg and M. Huth editors TACAS 2007 volume 4424 of LNCS pages 632--647. Springer 2007.","DOI":"10.1007\/978-3-540-71209-1_49"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806635"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022920129859"},{"key":"e_1_3_2_1_31_1","first-page":"11","volume-title":"LPAR 2005 (Short Papers)","author":"Weber T.","year":"2005"},{"volume-title":"M\u00fcnchen","year":"2008","author":"Weber T.","key":"e_1_3_2_1_32_1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1302944"}],"event":{"name":"PPDP '11: Symposium on Principles and Practices of Declarative Programming","sponsor":["University of Southern Denmark","Danish Agency for Science Technology and Innovation DASTI","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Odense Denmark","acronym":"PPDP '11"},"container-title":["Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003476.2003493","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2003476.2003493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:22Z","timestamp":1750244782000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003476.2003493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,20]]},"references-count":32,"alternative-id":["10.1145\/2003476.2003493","10.1145\/2003476"],"URL":"https:\/\/doi.org\/10.1145\/2003476.2003493","relation":{},"subject":[],"published":{"date-parts":[[2011,7,20]]},"assertion":[{"value":"2011-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}