{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:22Z","timestamp":1772164102657,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1526211"],"award-info":[{"award-number":["1526211"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR0011-16-C-0059"],"award-info":[{"award-number":["HR0011-16-C-0059"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1145\/3009837.3009864","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T16:20:29Z","timestamp":1482423629000},"page":"639-652","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Complexity verification using guided theorem enumeration"],"prefix":"10.1145","author":[{"given":"Akhilesh","family":"Srikanth","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, USA"}]},{"given":"Burak","family":"Sahin","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}]},{"given":"William R.","family":"Harris","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,1]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.07.009"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1882094.1882102"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516518"},{"key":"e_1_3_2_1_4_1","volume-title":"FMCAD","author":"Alur R.","year":"2015","unstructured":"R. Alur, R. Bodik, G. Juniwal, M. M. Martin, M. Raghothaman, S. A. Seshia, R. Singh, A. Solar-Lezama, E. Torlak, and A. Udupa. Syntax-guided synthesis. In FMCAD, 2015."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02959-2_23"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594301"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737955"},{"key":"e_1_3_2_1_9_1","volume-title":"Programming competition, programming contest, online computer programming. https:\/\/www.codechef.com\/","year":"2016","unstructured":"codechef. Programming competition, programming contest, online computer programming. https:\/\/www.codechef.com\/, 2016. Accessed: 2016 June 14. codeforces. Programming competitions and contests, programming community. https:\/\/www.codeforces.com\/, 2016. Accessed: 2016 June 14. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Springer, 1998."},{"key":"e_1_3_2_1_10_1","volume-title":"https:\/\/cve.mitre.org\/cgibin\/cvename.cgi?name=CVE-2011-3192","author":"CVE","year":"2015","unstructured":"cve-2011-3191. CVE - CVE-2011-3191. https:\/\/cve.mitre.org\/cgibin\/cvename.cgi?name=CVE-2011-3192, 2015."},{"key":"e_1_3_2_1_11_1","volume-title":"CAV","year":"2013","unstructured":"Accessed: 2015 July. L. Dai, B. Xia, and N. Zhan. Generating non-linear interpolants by semidefinite programming. In CAV, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_13_1","volume-title":"A framework for analyzing and transforming Java and Android applications. https:\/\/sable.github.io\/soot\/","year":"2016","unstructured":"framework. A framework for analyzing and transforming Java and Android applications. https:\/\/sable.github.io\/soot\/, 2016. Accessed: 2016."},{"key":"e_1_3_2_1_14_1","volume-title":"On undecidable propositions of formal mathematical systems","author":"G\u00f6del K.","year":"1934","unstructured":"K. G\u00f6del, S. C. Kleene, and J. B. Rosser. On undecidable propositions of formal mathematical systems. Institute for Advanced Study Princeton, NJ, 1934."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_35"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926423"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806630"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542518"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993536"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706353"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503279"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_16"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926427"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31365-3_27"},{"key":"e_1_3_2_1_26_1","volume-title":"LeetCode online judge. https:\/\/leetcode.com\/","year":"2016","unstructured":"leetcode. LeetCode online judge. https:\/\/leetcode.com\/, 2016. Accessed: 2016."},{"key":"e_1_3_2_1_27_1","volume-title":"https:\/\/leetcode.com\/problems\/ longest-increasing-subsequence\/","author":"LeetCode IS.","year":"2016","unstructured":"LIS. Problem LIS on LeetCode. https:\/\/leetcode.com\/problems\/ longest-increasing-subsequence\/, 2016. Accessed: 2016."},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/357073.357079"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737966"},{"key":"e_1_3_2_1_31_1","volume-title":"CAV","author":"Reynolds A.","year":"2015","unstructured":"A. Reynolds, M. Deters, V. Kuncak, C. Tinelli, and C. Barrett. Counterexample-guided quantifier instantiation for synthesis in smt. In CAV, 2015."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_50"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-4(4:1)2008"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065045"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1525\/9780520348097"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429132"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462174"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"},{"key":"e_1_3_2_1_39_1","volume-title":"https:\/\/github.com\/Z3Prover\/z3","year":"2015","unstructured":"z3. Z3prover\/z3 - github. https:\/\/github.com\/Z3Prover\/z3, 2015."},{"key":"e_1_3_2_1_40_1","unstructured":"Accessed: 2015 Nov 7. Introduction Overview An Iterative Implementation of Binary Search Inductive Step-Count Invariants Synthesizing Step-Count Invariants Background Target Language Program Structure Program Semantics Formal Logic Symbolic Representation of Program Semantics Interpolation Technical Approach Summaries Verification Algorithm Per-Path Bound Satisfaction as Tree-Interpolation Tree Interpolation by Theorem Enumeration The Theorem-Proving Algorithm Enumerating Quantifier-Free T-Theorems Properties Evaluation Benchmarks Results and Conclusions Related Work Conclusion"}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Paris France","acronym":"POPL '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009864","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009864","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:42:36Z","timestamp":1763458956000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":40,"alternative-id":["10.1145\/3009837.3009864","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009864","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009864","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"2017-01-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}