{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:56Z","timestamp":1772163956552,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,15]],"date-time":"2009-06-15T00:00:00Z","timestamp":1245024000000},"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,6,15]]},"DOI":"10.1145\/1542476.1542501","type":"proceedings-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T09:34:36Z","timestamp":1245144876000},"page":"223-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":69,"title":["Program verification using templates over predicate abstraction"],"prefix":"10.1145","author":[{"given":"Saurabh","family":"Srivastava","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, College Park, MD, USA"}]},{"given":"Sumit","family":"Gulwani","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"378","volume-title":"VMCAI","author":"Beyer Dirk","year":"2007","unstructured":"Dirk Beyer , Thomas Henzinger , Rupak Majumdar , and Andrey Rybalchenko . Invariant synthesis for combined theories . In VMCAI , volume 4349 of LNCS , pages 378 -- 394 , 2007 . Dirk Beyer, Thomas Henzinger, Rupak Majumdar, and Andrey Rybalchenko. Invariant synthesis for combined theories. In VMCAI, volume 4349 of LNCS, pages 378--394, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250769"},{"key":"e_1_3_2_1_3_1","first-page":"154","volume-title":"CAV","author":"Clarke Edmund M.","year":"2000","unstructured":"Edmund M. Clarke , Orna Grumberg , Somesh Jha , Yuan Lu , and Helmut Veith . Counterexample-guided abstraction refinement . In CAV , pages 154 -- 169 , 2000 . Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement. In CAV, pages 154--169, 2000."},{"key":"e_1_3_2_1_4_1","first-page":"420","volume-title":"CAV","author":"Colon Michael","year":"2003","unstructured":"Michael Colon , Sriram Sankaranarayanan , and Henny Sipma . Linear invariant generation using non-linear constraint solving . In CAV , pages 420 -- 432 , 2003 . Michael Colon, Sriram Sankaranarayanan, and Henny Sipma. Linear invariant generation using non-linear constraint solving. In CAV, pages 420--432, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_13"},{"key":"e_1_3_2_1_7_1","series-title":"LNCS","first-page":"337","volume-title":"TACAS","author":"de Moura Leonardo","year":"2008","unstructured":"Leonardo de Moura and Nikolaj Bjorner . Z3: Efficient SMT solver . In TACAS , volume 4963 of LNCS , pages 337 -- 340 , April 2008 . Leonardo de Moura and Nikolaj Bjorner. Z3: Efficient SMT solver. In TACAS, volume 4963 of LNCS, pages 337--340, April 2008."},{"key":"e_1_3_2_1_8_1","volume-title":"Model checking","author":"Clarke Jr.","year":"1999","unstructured":"Jr. Edmund M. Clarke , Orna Grumberg , and Doron A. Peled . Model checking . MIT Press , Cambridge, MA, USA , 1999 . Jr. Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. Model checking. MIT Press, Cambridge, MA, USA, 1999."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503291"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/647766.733618"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542518"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328468"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375616"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_13"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375623"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"e_1_3_2_1_17_1","volume-title":"CAV","author":"Jhala Ranjit","year":"2007","unstructured":"Ranjit Jhala and Ken McMillan . Array abstraction from proofs . In CAV , 2007 . Ranjit Jhala and Ken McMillan. Array abstraction from proofs. In CAV, 2007."},{"key":"e_1_3_2_1_18_1","volume-title":"Deduction and Applications","author":"Kapur Deepak","year":"2005","unstructured":"Deepak Kapur . Automatically generating loop invariants using quantifier elimination . In Deduction and Applications , 2005 . Deepak Kapur. Automatically generating loop invariants using quantifier elimination. In Deduction and Applications, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00593-0_33"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297658.1297662"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_19"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_21"},{"key":"e_1_3_2_1_24_1","unstructured":"Microsoft Research. Phoenix. http:\/\/research.microsoft.com\/Phoenix\/.  Microsoft Research. Phoenix. http:\/\/research.microsoft.com\/Phoenix\/."},{"key":"e_1_3_2_1_25_1","unstructured":"Microsoft Research. Z3. http:\/\/research.microsoft.com\/projects\/Z3\/.  Microsoft Research. Z3. http:\/\/research.microsoft.com\/projects\/Z3\/."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964028"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27864-1_7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250754"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168907"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_58"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375624"}],"event":{"name":"PLDI '09: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Dublin Ireland","acronym":"PLDI '09","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1542476.1542501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1542476.1542501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:29:49Z","timestamp":1750238989000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1542476.1542501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,15]]},"references-count":31,"alternative-id":["10.1145\/1542476.1542501","10.1145\/1542476"],"URL":"https:\/\/doi.org\/10.1145\/1542476.1542501","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1543135.1542501","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009,6,15]]},"assertion":[{"value":"2009-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}