{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T11:31:13Z","timestamp":1792841473850,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,5,21]],"date-time":"2011-05-21T00:00:00Z","timestamp":1305936000000},"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,5,21]]},"DOI":"10.1145\/1985793.1985839","type":"proceedings-article","created":{"date-parts":[[2011,5,24]],"date-time":"2011-05-24T13:04:30Z","timestamp":1306242270000},"page":"331-340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":105,"title":["Verifying multi-threaded software using smt-based context-bounded model checking"],"prefix":"10.1145","author":[{"given":"Lucas","family":"Cordeiro","sequence":"first","affiliation":[{"name":"University of Southampton, Southampton, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Fischer","sequence":"additional","affiliation":[{"name":"University of Southampton, Southampton, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-008-0091-0"},{"key":"e_1_3_2_1_2_1","volume-title":"Principles of Model Checking","author":"Baier C.","year":"2008"},{"key":"e_1_3_2_1_3_1","first-page":"457","volume-title":"Handbook of Satisfiability","author":"Biere A.","year":"2009"},{"key":"e_1_3_2_1_4_1","volume-title":"FMCAD","author":"Cimatti A.","year":"2010"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_40"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECBS.2007.16"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2009.63"},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001"},{"key":"e_1_3_2_1_10_1","first-page":"337","article-title":"de Moura and N. Bj\u00f8rner. Z3: An efficient SMT solver. TACAS","volume":"4963","author":"L.","year":"2008","journal-title":"LNCS"},{"key":"e_1_3_2_1_11_1","volume-title":"LPAR Workshops","author":"de Moura L. M.","year":"2008"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233664"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85114-1_10"},{"key":"e_1_3_2_1_14_1","first-page":"227","article-title":"Context-bounded translations for concurrent software: An empirical evaluation. SPIN","volume":"6349","author":"Ghafari N.","year":"2010","journal-title":"LNCS"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040316"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_12"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_31"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0078-9"},{"key":"e_1_3_2_1_19_1","first-page":"2","article-title":"Automatic abstraction without counterexamples. TACAS","volume":"2619","author":"McMillan K. L.","year":"2003","journal-title":"LNCS"},{"key":"e_1_3_2_1_20_1","first-page":"29","volume-title":"USENIX","author":"Mueller F.","year":"1993"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250785"},{"key":"e_1_3_2_1_22_1","unstructured":"http:\/\/www.nxp.com\/ 2009.  http:\/\/www.nxp.com\/ 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996845"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639622.1639631"},{"key":"e_1_3_2_1_27_1","unstructured":"SMT-LIB. The Satisfiability Modulo Theories Library. http:\/\/combination.cs.uiowa.edu\/smtlib 2009.  SMT-LIB. The Satisfiability Modulo Theories Library. http:\/\/combination.cs.uiowa.edu\/smtlib 2009."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_36"},{"key":"e_1_3_2_1_29_1","unstructured":"http:\/\/www.cs.utah.edu\/ 2010.  http:\/\/www.cs.utah.edu\/ 2010."}],"event":{"name":"ICSE11: International Conference on Software Engineering","location":"Waikiki, Honolulu HI USA","acronym":"ICSE11","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 33rd International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1985793.1985839","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1985793.1985839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:30Z","timestamp":1750244790000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1985793.1985839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,21]]},"references-count":29,"alternative-id":["10.1145\/1985793.1985839","10.1145\/1985793"],"URL":"https:\/\/doi.org\/10.1145\/1985793.1985839","relation":{},"subject":[],"published":{"date-parts":[[2011,5,21]]},"assertion":[{"value":"2011-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}