{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T20:15:41Z","timestamp":1784232941385,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T00:00:00Z","timestamp":1257120000000},"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":[[2009,11,2]]},"DOI":"10.1145\/1687399.1687403","type":"proceedings-article","created":{"date-parts":[[2010,1,5]],"date-time":"2010-01-05T15:05:14Z","timestamp":1262703914000},"page":"13-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["A scalable decision procedure for fixed-width bit-vectors"],"prefix":"10.1145","author":[{"given":"Roberto","family":"Bruttomesso","sequence":"first","affiliation":[{"name":"Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Natasha","family":"Sharygina","sequence":"additional","affiliation":[{"name":"Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,11,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770351.1770397"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277186"},{"key":"e_1_3_2_1_3_1","volume-title":"TACAS","author":"Biere A.","year":"2009","unstructured":"A. Biere and R. Brummayer . The Boolector SMT Solver . In TACAS , 2009 . A. Biere and R. Brummayer. The Boolector SMT Solver. In TACAS, 2009."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646482.691584"},{"key":"e_1_3_2_1_5_1","first-page":"247","volume-title":"CAV","author":"Bruttomesso R.","year":"2007","unstructured":"R. Bruttomesso , A. Cimatti , A. Franzen , A. Griggio , Z. Hanna , A. Nadel , A. Palti , and R. Sebastiani . A Lazy and Layered SMT(BV) Solver for Hard Industrial Verification Problems . In CAV , pages 247 -- 260 , 2007 . R. Bruttomesso, A. Cimatti, A. Franzen, A. Griggio, Z. Hanna, A. Nadel, A. Palti, and R. Sebastiani. A Lazy and Layered SMT(BV) Solver for Hard Industrial Verification Problems. In CAV, pages 247--260, 2007."},{"key":"e_1_3_2_1_7_1","volume-title":"CAV","author":"Bryant R. E.","year":"2002","unstructured":"R. E. Bryant , S. K. Lahiri , and S. A. Seshia . Modeling and Verifying Systems using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions . In CAV , 2002 . R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and Verifying Systems using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions. In CAV, 2002."},{"key":"e_1_3_2_1_8_1","first-page":"60","volume-title":"CAV","author":"Cyrluk D.","year":"1997","unstructured":"D. Cyrluk , M. O. M\u00f6ller , and H. Rue\u00df . An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors . In CAV , pages 60 -- 71 , 1997 . D. Cyrluk, M. O. M\u00f6ller, and H. Rue\u00df. An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors. In CAV, pages 60--71, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066100.1066102"},{"key":"e_1_3_2_1_11_1","unstructured":"B. Dutertre and L. de Moura. The Yices SMT Solver. Tool paper available at http:\/\/yices.csl.sri.com\/tool-paper.pdf.  B. Dutertre and L. de Moura. The Yices SMT Solver. Tool paper available at http:\/\/yices.csl.sri.com\/tool-paper.pdf."},{"key":"e_1_3_2_1_12_1","volume-title":"A Decision Procedure for Fixed-Width Bit-Vectors. Technical report","author":"Ganesh V.","year":"2005","unstructured":"V. Ganesh , S. Berezin , and D. L. Dill . A Decision Procedure for Fixed-Width Bit-Vectors. Technical report , University of Stanford , 2005 . Available at http:\/\/theory.stanford.edu\/~vganesh\/bitvector-tech-report.ps. V. Ganesh, S. Berezin, and D. L. Dill. A Decision Procedure for Fixed-Width Bit-Vectors. Technical report, University of Stanford, 2005. Available at http:\/\/theory.stanford.edu\/~vganesh\/bitvector-tech-report.ps."},{"key":"e_1_3_2_1_13_1","first-page":"519","volume-title":"CAV","author":"Ganesh V.","year":"2007","unstructured":"V. Ganesh and D. L. Dill . A Decision Procedure for Bit-Vectors and Arrays . In CAV , pages 519 -- 531 , 2007 . V. Ganesh and D. L. Dill. A Decision Procedure for Bit-Vectors and Arrays. In CAV, pages 519--531, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_53"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90009-9"},{"key":"e_1_3_2_1_16_1","first-page":"303","volume-title":"CAV","author":"Manolios P.","year":"2007","unstructured":"P. Manolios , S. K. Srinivasan , and D. Vroon . BAT: The Bit-Level Analysis Tool . In CAV , pages 303 -- 306 , 2007 . P. Manolios, S. K. Srinivasan, and D. Vroon. BAT: The Bit-Level Analysis Tool. In CAV, pages 303--306, 2007."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_33"},{"key":"e_1_3_2_1_18_1","unstructured":"Peter M. Nyasulu. Introduction to Verilog. Available at http:\/\/www.doe.carleton.ca\/~shams\/97350\/PetervrlK.pdf.  Peter M. Nyasulu. Introduction to Verilog. Available at http:\/\/www.doe.carleton.ca\/~shams\/97350\/PetervrlK.pdf."},{"key":"e_1_3_2_1_19_1","unstructured":"OpenSMT. http:\/\/verify.inf.unisi.ch\/opensmt.  OpenSMT. http:\/\/verify.inf.unisi.ch\/opensmt."},{"key":"e_1_3_2_1_20_1","first-page":"144","volume":"3","author":"Sebastiani R.","year":"2007","unstructured":"R. Sebastiani . Lazy Satisfiability Modulo Theories. JSAT , 3 : 144 -- 224 , 2007 . R. Sebastiani. Lazy Satisfiability Modulo Theories. JSAT, 3:144--224, 2007.","journal-title":"Lazy Satisfiability Modulo Theories. JSAT"},{"key":"e_1_3_2_1_21_1","unstructured":"Spear. http:\/\/www.cs.ubc.ca\/~babic\/.  Spear. http:\/\/www.cs.ubc.ca\/~babic\/."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSISOC.2007.4402478"}],"event":{"name":"ICCAD '09: The International Conference on Computer-Aided Design","location":"San Jose California","acronym":"ICCAD '09","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE Council on Electronic Design Automation (CEDA)"]},"container-title":["Proceedings of the 2009 International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1687399.1687403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1687399.1687403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:00Z","timestamp":1750278360000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1687399.1687403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,2]]},"references-count":22,"alternative-id":["10.1145\/1687399.1687403","10.1145\/1687399"],"URL":"https:\/\/doi.org\/10.1145\/1687399.1687403","relation":{},"subject":[],"published":{"date-parts":[[2009,11,2]]},"assertion":[{"value":"2009-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}