{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T02:43:20Z","timestamp":1784342600102,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T00:00:00Z","timestamp":1383004800000},"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":[[2013,10,29]]},"DOI":"10.1145\/2509136.2509511","type":"proceedings-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T11:29:17Z","timestamp":1382527757000},"page":"443-456","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":79,"title":["Inductive invariant generation via abductive inference"],"prefix":"10.1145","author":[{"given":"Isil","family":"Dillig","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Dillig","sequence":"additional","affiliation":[{"name":"University College London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boyang","family":"Li","sequence":"additional","affiliation":[{"name":"College of William & Mary, Williamsburg, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ken","family":"McMillan","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Karr M.: Affine relationships among variables of a program. A. I. (1976) 133--151.  Karr M.: Affine relationships among variables of a program. A. I. (1976) 133--151.","DOI":"10.1007\/BF00268497"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_48"},{"key":"e_1_3_2_1_6_1","volume-title":"Sipma","author":"Col\u00f3n M.","year":"2003","unstructured":"Col\u00f3n , M. , Sankaranarayanan , S. , Sipma , H. : Linear invariant generation using non-linear constraint solving. In : Computer Aided Verification, Springer ( 2003 ) 420--432. Col\u00f3n, M., Sankaranarayanan, S., Sipma, H.: Linear invariant generation using non-linear constraint solving. In: Computer Aided Verification, Springer (2003) 420--432."},{"key":"e_1_3_2_1_7_1","volume-title":"International conference on Model checking software. (2003)","author":"Henzinger T.","unstructured":"Henzinger , T. , Jhala , R. , Majumdar , R. , Sutre , G. : Software verification with BLAST . In: International conference on Model checking software. (2003) 235--239. Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Software verification with BLAST. In: International conference on Model checking software. (2003) 235--239."},{"key":"e_1_3_2_1_8_1","volume-title":"Rajamani","author":"Ball T.","year":"2001","unstructured":"Ball , T. , Rajamani , S. : The slam toolkit. In : Computer aided verification, Springer ( 2001 ) 260--264. Ball, T., Rajamani, S.: The slam toolkit. In: Computer aided verification, Springer (2001) 260--264."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/982962.964021"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45069-6_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1939141.1939161"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_15_1","volume-title":"Collected papers of Charles Sanders Peirce","author":"Peirce C.","year":"1932","unstructured":"Peirce , C. : Collected papers of Charles Sanders Peirce . Belknap Press ( 1932 ). Peirce, C.: Collected papers of Charles Sanders Peirce. Belknap Press (1932)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_30"},{"issue":"91","key":"e_1_3_2_1_17_1","first-page":"300","volume":"7","author":"Cooper D.","year":"1972","unstructured":"Cooper , D. : Theorem proving in arithmetic without multiplication. Machine Intelligence 7 ( 91-99 ) ( 1972 ) 300 . Cooper, D.: Theorem proving in arithmetic without multiplication. Machine Intelligence 7(91-99) (1972) 300.","journal-title":"Machine Intelligence"},{"key":"e_1_3_2_1_19_1","volume-title":"Aiken","author":"Dillig I.","year":"2011","unstructured":"Dillig , I. , Dillig , T. , Aiken , A. : Small formulas for large programs: On-line constraint simplification in scalable static analysis. SAS ( 2011 ). Dillig, I., Dillig, T., Aiken, A.: Small formulas for large programs: On-line constraint simplification in scalable static analysis. SAS (2011)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_20"},{"key":"e_1_3_2_1_21_1","unstructured":"Jeannet B.: Interproc analyzer for recursive programs with numerical variables. http:\/\/pop-art.inrialpes.fr\/interproc\/interprocweb.cgi.  Jeannet B.: Interproc analyzer for recursive programs with numerical variables. http:\/\/pop-art.inrialpes.fr\/interproc\/interprocweb.cgi."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375616"},{"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.1007\/978-3-642-31424-7_11"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_34"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190215.1190258"},{"key":"e_1_3_2_1_28_1","volume-title":"Rajamani","author":"Gulavani B.","year":"2008","unstructured":"Gulavani , B. , Chakraborty , S. , Nori , A. , Rajamani , S. : Automatically refining abstract interpretations. TACAS ( 2008 ) 443--458. Gulavani, B., Chakraborty, S., Nori, A., Rajamani, S.: Automatically refining abstract interpretations. TACAS (2008) 443--458."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250769"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-008-0080-9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1181775.1181790"},{"key":"e_1_3_2_1_32_1","unstructured":"http:\/\/pub.ist.ac.at\/agupta\/invgen\/: InvGen tool.  http:\/\/pub.ist.ac.at\/agupta\/invgen\/: InvGen tool."},{"key":"e_1_3_2_1_33_1","unstructured":"http:\/\/www.nec-labs.com\/research\/system\/systems_SAV-website\/benchmarks.php: NECLABS NECLA verification benchmarks.  http:\/\/www.nec-labs.com\/research\/system\/systems_SAV-website\/benchmarks.php: NECLABS NECLA verification benchmarks."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_20"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_13"},{"key":"e_1_3_2_1_37_1","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity (2001)","author":"Flanagan C.","unstructured":"Flanagan , C. , Leino , K. : Houdini, an annotation assistant for esc\/java . FME 2001: Formal Methods for Increasing Software Productivity (2001) 500--517. Flanagan, C., Leino, K.: Houdini, an annotation assistant for esc\/java. FME 2001: Formal Methods for Increasing Software Productivity (2001) 500--517."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.01.015"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_14"},{"key":"e_1_3_2_1_40_1","volume-title":"Visser","author":"P\u0103s\u0103reanu C. S.","year":"2004","unstructured":"P\u0103s\u0103reanu , C. S. , Visser , W. : Verification of java programs using symbolic execution and invariant generation. In : SPIN Workshop on Model Checking Software. Springer ( 2004 ) 164--181. P\u0103s\u0103reanu, C. S., Visser, W.: Verification of java programs using symbolic execution and invariant generation. In: SPIN Workshop on Model Checking Software. Springer (2004) 164--181."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946284.1946291"},{"key":"e_1_3_2_1_42_1","volume-title":"Proceedings of the International Conference on Formal Methods in Computer-Aided Design, FMCAD Inc (2011)","author":"Somenzi F.","unstructured":"Somenzi , F. , Bradley , A. : IC3: where monolithic and incremental meet . In: Proceedings of the International Conference on Formal Methods in Computer-Aided Design, FMCAD Inc (2011) 3--8. Somenzi, F., Bradley, A.: IC3: where monolithic and incremental meet. In: Proceedings of the International Conference on Formal Methods in Computer-Aided Design, FMCAD Inc (2011) 3--8."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594834.1480917"},{"key":"e_1_3_2_1_44_1","volume-title":"Proceedings of the 1994 International Symposium on Logic programming, Citeseer (1994)","author":"Giacobazzi R.","unstructured":"Giacobazzi , R. : Abductive analysis of modular logic programs . In: Proceedings of the 1994 International Symposium on Logic programming, Citeseer (1994) 377--391. Giacobazzi, R.: Abductive analysis of modular logic programs. In: Proceedings of the 1994 International Symposium on Logic programming, Citeseer (1994) 377--391."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328468"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10672-9_19"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254087"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_26"},{"key":"e_1_3_2_1_49_1","volume-title":"Musuvathi","author":"Gulwani S.","year":"2008","unstructured":"Gulwani , S. , Musuvathi , M. : Cover Algorithms . In : ESOP. ( 2008 ) 193--207. Gulwani, S., Musuvathi, M.: Cover Algorithms. In: ESOP. (2008) 193--207."}],"event":{"name":"SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Indianapolis Indiana USA","acronym":"SPLASH '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509136.2509511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2509136.2509511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:34Z","timestamp":1750217314000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509136.2509511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,29]]},"references-count":48,"alternative-id":["10.1145\/2509136.2509511","10.1145\/2509136"],"URL":"https:\/\/doi.org\/10.1145\/2509136.2509511","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544173.2509511","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,10,29]]},"assertion":[{"value":"2013-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}