{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:02:11Z","timestamp":1776304931595,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T00:00:00Z","timestamp":1464825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["321174- VSSC"],"award-info":[{"award-number":["321174- VSSC"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["652\/11"],"award-info":[{"award-number":["652\/11"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,2]]},"DOI":"10.1145\/2908080.2908118","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T15:23:42Z","timestamp":1464881022000},"page":"614-630","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":118,"title":["Ivy: safety verification by interactive generalization"],"prefix":"10.1145","author":[{"given":"Oded","family":"Padon","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth L.","family":"McMillan","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aurojit","family":"Panda","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharon","family":"Shoham","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2843"},{"key":"e_1_3_2_1_2_1","first-page":"87","volume-title":"VMCAI","author":"Bradley A. R.","year":"2011","unstructured":"A. R. Bradley . Sat-based model checking without unrolling. In Verification, Model Checking, and Abstract Interpretation - 12th International Conference , VMCAI , pages 70\u2013 87 , 2011 . A. R. Bradley. Sat-based model checking without unrolling. In Verification, Model Checking, and Abstract Interpretation - 12th International Conference, VMCAI, pages 70\u201387, 2011."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/359104.359108"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_5_1","volume-title":"A Discipline of Programming","author":"Dijkstra E. W.","year":"1976","unstructured":"E. W. Dijkstra . A Discipline of Programming . Prentice-Hall , 1976 . E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647540.730008"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146681"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815428"},{"key":"e_1_3_2_1_9_1","first-page":"110","volume-title":"First International Workshop, TACAS","author":"Henriksen J. G.","year":"1995","unstructured":"J. G. Henriksen , J. L. Jensen , M. E. J\u00f8rgensen , N. Klarlund , R. Paige , T. Rauhe , and A. Sandholm . Mona: Monadic second-order logic in practice. In Tools and Algorithms for Construction and Analysis of Systems , First International Workshop, TACAS , pages 89\u2013 110 , 1995 . J. G. Henriksen, J. L. Jensen, M. E. J\u00f8rgensen, N. Klarlund, R. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithms for Construction and Analysis of Systems, First International Workshop, TACAS, pages 89\u2013110, 1995."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_1_11_1","first-page":"178","article-title":"The coq proof assistant a tutorial","author":"Huet G.","year":"1997","unstructured":"G. Huet , G. Kahn , and C. Paulin-Mohring . The coq proof assistant a tutorial . Rapport Technique , 178 , 1997 . G. Huet, G. Kahn, and C. Paulin-Mohring. The coq proof assistant a tutorial. Rapport Technique, 178, 1997.","journal-title":"Rapport Technique"},{"key":"e_1_3_2_1_12_1","unstructured":"IronFleet Project. Distributed lock service protocol source code. https:\/\/ github.com\/Microsoft\/Ironclad\/blob\/ 40b281f9f9fa7cfca5a00a7085cb302e6b1a9aa6\/ ironfleet\/src\/Dafny\/Distributed\/Protocol\/ Lock\/Node.i.dfy. Accessed: 2016-03-20.  IronFleet Project. Distributed lock service protocol source code. https:\/\/ github.com\/Microsoft\/Ironclad\/blob\/ 40b281f9f9fa7cfca5a00a7085cb302e6b1a9aa6\/ ironfleet\/src\/Dafny\/Distributed\/Protocol\/ Lock\/Node.i.dfy. Accessed: 2016-03-20."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535854"},{"key":"e_1_3_2_1_14_1","first-page":"772","volume-title":"CAV","author":"Itzhaky S.","year":"2013","unstructured":"S. Itzhaky , A. Banerjee , N. Immerman , A. Nanevski , and M. Sagiv . Effectively-propositional reasoning about reachability in linked data structures. In Computer Aided Verification - 25th International Conference , CAV , pages 756\u2013 772 , 2013 . S. Itzhaky, A. Banerjee, N. Immerman, A. Nanevski, and M. Sagiv. Effectively-propositional reasoning about reachability in linked data structures. In Computer Aided Verification - 25th International Conference, CAV, pages 756\u2013772, 2013."},{"key":"e_1_3_2_1_15_1","unstructured":"Ivy PLDI\u201916 web page. https:\/\/www.cs.tau.ac.il\/ \u02dcodedp\/ivy\/.  Ivy PLDI\u201916 web page. https:\/\/www.cs.tau.ac.il\/ \u02dcodedp\/ivy\/."},{"key":"e_1_3_2_1_16_1","volume-title":"Software Abstractions: Resources and Additional Materials","author":"Jackson D.","year":"2011","unstructured":"D. Jackson . Software Abstractions: Resources and Additional Materials . MIT Press , 2011 . D. Jackson. Software Abstractions: Resources and Additional Materials. MIT Press, 2011."},{"key":"e_1_3_2_1_17_1","first-page":"602","volume-title":"CAV","author":"Karbyshev A.","year":"2015","unstructured":"A. Karbyshev , N. Bj\u00f8rner , S. Itzhaky , N. Rinetzky , and S. Shoham . Property-directed inference of universal invariants or proving their absence. In Computer Aided Verification - 27th International Conference , CAV , pages 583\u2013 602 , 2015 . A. Karbyshev, N. Bj\u00f8rner, S. Itzhaky, N. Rinetzky, and S. Shoham. Property-directed inference of universal invariants or proving their absence. In Computer Aided Verification - 27th International Conference, CAV, pages 583\u2013602, 2015."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1743546.1743574"},{"key":"e_1_3_2_1_19_1","first-page":"370","volume-title":"LPAR-16","author":"Leino K. R. M.","year":"2010","unstructured":"K. R. M. Leino . Dafny : An automatic program verifier for functional correctness. In Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference , LPAR-16 , pages 348\u2013 370 , 2010 . K. R. M. Leino. Dafny: An automatic program verifier for functional correctness. In Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, pages 348\u2013370, 2010."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90027-6"},{"key":"e_1_3_2_1_22_1","first-page":"59","volume-title":"SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings","author":"Madhusudan P.","year":"2011","unstructured":"P. Madhusudan and X. Qiu . Efficient decision procedures for heaps using STRAND. In Static Analysis - 18th International Symposium , SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings , pages 43\u2013 59 , 2011 . P. Madhusudan and X. Qiu. Efficient decision procedures for heaps using STRAND. In Static Analysis - 18th International Symposium, SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings, pages 43\u201359, 2011."},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL - A Proof Assistant for Higher-Order Logic","author":"Nipkow T.","year":"2002","unstructured":"T. Nipkow , L. C. Paulson , and M. Wenzel . Isabelle\/HOL - A Proof Assistant for Higher-Order Logic , volume 2283 of Lecture Notes in Computer Science . Springer , 2002 . T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle\/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer, 2002."},{"key":"e_1_3_2_1_24_1","volume-title":"private communication","author":"Parno B.","year":"2016","unstructured":"B. Parno . private communication , 2016 . B. Parno. private communication, 2016."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2007.53"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-009-9161-6"},{"key":"e_1_3_2_1_27_1","first-page":"97","volume-title":"7th International Conference, TACAS","author":"Pnueli A.","year":"2001","unstructured":"A. Pnueli , S. Ruah , and L. D. Zuck . Automatic deductive verification with invisible invariants. In Tools and Algorithms for the Construction and Analysis of Systems , 7th International Conference, TACAS , pages 82\u2013 97 , 2001 . A. Pnueli, S. Ruah, and L. D. Zuck. Automatic deductive verification with invisible invariants. In Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference, TACAS, pages 82\u201397, 2001."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737958"},{"key":"e_1_3_2_1_29_1","volume-title":"How to make chord correct (using a stable base). CoRR, abs\/1502.06461","author":"Zave P.","year":"2015","unstructured":"P. Zave . How to make chord correct (using a stable base). CoRR, abs\/1502.06461 , 2015 . P. Zave. How to make chord correct (using a stable base). CoRR, abs\/1502.06461, 2015."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522729"}],"event":{"name":"PLDI '16: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Santa Barbara CA USA","acronym":"PLDI '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908080.2908118","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2908080.2908118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:54:50Z","timestamp":1750208090000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2908080.2908118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,2]]},"references-count":30,"alternative-id":["10.1145\/2908080.2908118","10.1145\/2908080"],"URL":"https:\/\/doi.org\/10.1145\/2908080.2908118","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2980983.2908118","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,6,2]]},"assertion":[{"value":"2016-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}