{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:26Z","timestamp":1750307666449,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,8]],"date-time":"2009-03-08T00:00:00Z","timestamp":1236470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["475743\/2007-5"],"award-info":[{"award-number":["475743\/2007-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,3,8]]},"DOI":"10.1145\/1529282.1529404","type":"proceedings-article","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T13:37:11Z","timestamp":1239802631000},"page":"566-573","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The synergy of precise and fast abstractions for program verification"],"prefix":"10.1145","author":[{"given":"Natasha","family":"Sharygina","sequence":"first","affiliation":[{"name":"University of Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Tonetta","sequence":"additional","affiliation":[{"name":"Fondazione Bruno Kessler, Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aliaksei","family":"Tsitovich","sequence":"additional","affiliation":[{"name":"University of Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_30"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-002-0095-0"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90017-A"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333874.1334136"},{"key":"e_1_3_2_1_9_1","volume-title":"SAT","author":"Clarke E.","year":"2003","unstructured":"E. Clarke , M. Talupur , H. Veith , and D. Wang . SAT Based Predicate Abstraction for Hardware Verification . In SAT , 2003 . E. Clarke, M. Talupur, H. Veith, and D. Wang. SAT Based Predicate Abstraction for Hardware Verification. In SAT, 2003."},{"key":"e_1_3_2_1_10_1","first-page":"154","volume-title":"CAV","author":"Clarke E. M.","year":"2000","unstructured":"E. M. Clarke , O. Grumberg , S. Jha , Y. Lu , and H. Veith . Counterexample-Guided Abstraction Refinement . In CAV , pages 154 -- 169 , 2000 . E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-Guided Abstraction Refinement. In CAV, pages 154--169, 2000."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/186025.186051"},{"key":"e_1_3_2_1_12_1","first-page":"265","volume-title":"CAV","author":"Clarke E. M.","year":"2002","unstructured":"E. M. Clarke , A. Gupta , J. H. Kukula , and O. Strichman . SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques . In CAV , pages 265 -- 279 , 2002 . E. M. Clarke, A. Gupta, J. H. Kukula, and O. Strichman. SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques. In CAV, pages 265--279, 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:FORM.0000040025.89719.f3"},{"key":"e_1_3_2_1_14_1","first-page":"293","volume-title":"CAV","author":"Col\u00f3n M.","year":"1998","unstructured":"M. Col\u00f3n and T. E. Uribe . Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures . In CAV , pages 293 -- 304 , 1998 . M. Col\u00f3n and T. E. Uribe. Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures. In CAV, pages 293--304, 1998."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/871816.871856"},{"key":"e_1_3_2_1_16_1","volume-title":"CAV","author":"Das S.","year":"1999","unstructured":"S. Das , D. L. Dill , and S. Park . Experience with Predicate Abstraction . In CAV , 1999 . S. Das, D. L. Dill, and S. Park. Experience with Predicate Abstraction. In CAV, 1999."},{"key":"e_1_3_2_1_17_1","first-page":"72","volume-title":"CAV","author":"Graf S.","year":"1997","unstructured":"S. Graf and H. Sa\u00efdi . Construction of Abstract State Graphs with PVS . In CAV , pages 72 -- 83 , 1997 . S. Graf and H. Sa\u00efdi. Construction of Abstract State Graphs with PVS. In CAV, pages 72--83, 1997."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_11"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503279"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065697"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_26"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_33"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321691"},{"key":"e_1_3_2_1_26_1","volume-title":"Predicate Abstraction via Symbolic Decision Procedures. Logical Methods in Computer Science, 3(2)","author":"Lahiri S. K.","year":"2007","unstructured":"S. K. Lahiri , T. Ball , and B. Cook . Predicate Abstraction via Symbolic Decision Procedures. Logical Methods in Computer Science, 3(2) , 2007 . S. K. Lahiri, T. Ball, and B. Cook. Predicate Abstraction via Symbolic Decision Procedures. Logical Methods in Computer Science, 3(2), 2007."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_39"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_14"},{"key":"e_1_3_2_1_29_1","first-page":"250","volume-title":"CAV","author":"McMillan K. L.","year":"2002","unstructured":"K. L. McMillan . Applying SAT Methods in Unbounded Symbolic Model Checking . In CAV , pages 250 -- 264 , 2002 . K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In CAV, pages 250--264, 2002."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/555142"}],"event":{"name":"SAC09: The 2009 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Honolulu Hawaii","acronym":"SAC09"},"container-title":["Proceedings of the 2009 ACM symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1529282.1529404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1529282.1529404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:33Z","timestamp":1750253373000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1529282.1529404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,8]]},"references-count":28,"alternative-id":["10.1145\/1529282.1529404","10.1145\/1529282"],"URL":"https:\/\/doi.org\/10.1145\/1529282.1529404","relation":{},"subject":[],"published":{"date-parts":[[2009,3,8]]},"assertion":[{"value":"2009-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}