{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T14:03:36Z","timestamp":1793196216434,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-14-2-0270, FA8750-15-C-0082"],"award-info":[{"award-number":["FA8750-14-2-0270, FA8750-15-C-0082"]}],"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,6,14]]},"DOI":"10.1145\/3062341.3062373","type":"proceedings-article","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T10:01:04Z","timestamp":1497434464000},"page":"248-262","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Compositional recurrence analysis revisited"],"prefix":"10.1145","author":[{"given":"Zachary","family":"Kincaid","sequence":"first","affiliation":[{"name":"Princeton University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jason","family":"Breck","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashkan Forouhi","family":"Boroujeni","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, USA \/ GrammaTech, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"APRON. APRON numerical abstract domain library.  APRON. APRON numerical abstract domain library."},{"key":"e_1_3_2_2_2_1","first-page":"15","article-title":"Regular algebra applied to pathfinding problems","author":"Backhouse R.","year":"1975","unstructured":"R. Backhouse and B. Carr\u00e9 . Regular algebra applied to pathfinding problems . J. Inst. Maths. Applics. , 15 , 1975 . R. Backhouse and B. Carr\u00e9. Regular algebra applied to pathfinding problems. J. Inst. Maths. Applics., 15, 1975.","journal-title":"J. Inst. Maths. Applics."},{"key":"e_1_3_2_2_3_1","volume-title":"CAV","author":"Beyer D.","year":"2011","unstructured":"D. Beyer and M. Keremoglu . CPAchecker: A tool for configurable software verification . In CAV , 2011 . D. Beyer and M. Keremoglu. CPAchecker: A tool for configurable software verification. In CAV, 2011."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33125-1_16"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646732.701281"},{"key":"e_1_3_2_2_6_1","volume-title":"Workshop on Invariant Generation","author":"Bozga M.","year":"2012","unstructured":"M. Bozga , R. Iosif , F. Kone\u02c7 cn\u00fd, and T. Vojnar . Tool demonstration of the FLATA counter automata toolset . In Workshop on Invariant Generation , 2012 . M. Bozga, R. Iosif, F. Kone\u02c7 cn\u00fd, and T. Vojnar. Tool demonstration of the FLATA counter automata toolset. In Workshop on Invariant Generation, 2012."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737955"},{"key":"e_1_3_2_2_8_1","volume-title":"Yale Univ.","author":"Carbonneaux Q.","year":"2015","unstructured":"Q. Carbonneaux , J. Hoffmann , and Z. Shao . Compositional certified resource bounds (extended version). YALEU\/DCS\/TR-1505 , Yale Univ. , New Haven, CT , Apr. 2015 . Q. Carbonneaux, J. Hoffmann, and Z. Shao. Compositional certified resource bounds (extended version). YALEU\/DCS\/TR-1505, Yale Univ., New Haven, CT, Apr. 2015."},{"key":"e_1_3_2_2_9_1","first-page":"7","article-title":"An algebra for network routing problems","author":"Carr\u00e9 B.","year":"1971","unstructured":"B. Carr\u00e9 . An algebra for network routing problems . J. Inst. Maths. Applics. , 7 , 1971 . B. Carr\u00e9. An algebra for network routing problems. J. Inst. Maths. Applics., 7, 1971.","journal-title":"J. Inst. Maths. Applics."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1857914.1857917"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2893529.2893544"},{"key":"e_1_3_2_2_15_1","first-page":"9","article-title":"A direct symbolic approach to model checking pushdown systems","author":"Finkel A.","year":"1997","unstructured":"A. Finkel , B. Willems , and P. Wolper . A direct symbolic approach to model checking pushdown systems . ENTCS , 9 , 1997 . A. Finkel, B.Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. ENTCS, 9, 1997.","journal-title":"ENTCS"},{"key":"e_1_3_2_2_16_1","volume-title":"Softw. Tools for Tech. Transfer","author":"Ganty P.","year":"2016","unstructured":"P. Ganty , R. Iosif , and F. Kone\u02c7 cn\u00fd. Underapproximation of procedure summaries for integer programs . Softw. Tools for Tech. Transfer , 2016 . P. Ganty, R. Iosif, and F. Kone\u02c7 cn\u00fd. Underapproximation of procedure summaries for integer programs. Softw. Tools for Tech. Transfer, 2016."},{"key":"e_1_3_2_2_17_1","unstructured":"Corrected version available as arXiv:1210.4289v3 (10.1007\/s10009-016-0420-7).  Corrected version available as arXiv:1210.4289v3 (10.1007\/s10009-016-0420-7)."},{"key":"e_1_3_2_2_18_1","volume-title":"Graphs, Dioids and Semirings: New Models and Algorithms","author":"Gondran M.","year":"2010","unstructured":"M. Gondran and M. Minoux . Graphs, Dioids and Semirings: New Models and Algorithms . Springer-Verlag , 2010 . M. Gondran and M. Minoux. Graphs, Dioids and Semirings: New Models and Algorithms. Springer-Verlag, 2010."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2013.09.016"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806630"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480898"},{"key":"e_1_3_2_2_22_1","volume-title":"CAV","author":"Gurfinkel A.","year":"2015","unstructured":"A. Gurfinkel , T. Kahsai , A. Komuravelli , and J. Navas . The SeaHorn verification framework . In CAV , 2015 . A. Gurfinkel, T. Kahsai, A. Komuravelli, and J. Navas. The SeaHorn verification framework. In CAV, 2015."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_53"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535843"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_6"},{"key":"e_1_3_2_2_26_1","volume-title":"WALi: The Weighted Automaton Library","author":"Kidd N.","year":"2007","unstructured":"N. Kidd , A. Lal , and T. Reps . WALi: The Weighted Automaton Library , 2007 . N. Kidd, A. Lal, and T. Reps. WALi: The Weighted Automaton Library, 2007."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_3_2_2_28_1","volume-title":"Comp. Sci. Dept.","author":"Kincaid Z.","year":"2016","unstructured":"Z. Kincaid , J. Breck , A. Forouhi Boroujeni , and T. Reps . Compositional recurrence analysis revisited. TR-1840 , Comp. Sci. Dept. , Univ. of Wisconsin , Madison, WI , Oct. 2016 . Revised, Apr. 2017. Z. Kincaid, J. Breck, A. Forouhi Boroujeni, and T. Reps. Compositional recurrence analysis revisited. TR-1840, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI, Oct. 2016. Revised, Apr. 2017."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88387-6_10"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_32"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0078-9"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792761"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2391451.2391465"},{"key":"e_1_3_2_2_34_1","first-page":"40","article-title":"Program analysis via graph reachability","author":"Reps T.","year":"1998","unstructured":"T. Reps . Program analysis via graph reachability . IST , 40 , 1998 . T. Reps. Program analysis via graph reachability. IST, 40, 1998.","journal-title":"IST"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.009"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837659"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9076-0_9"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/27632.27649"},{"key":"e_1_3_2_2_39_1","volume-title":"Program Flow Analysis: Theory and Applications","author":"Sharir M.","year":"1981","unstructured":"M. Sharir and A. Pnueli . Two approaches to interprocedural data flow analysis . In Program Flow Analysis: Theory and Applications . Prentice-Hall , 1981 . M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981."},{"key":"e_1_3_2_2_40_1","volume-title":"competition on software verification (SV-COMP16)","year":"2016","unstructured":"SVCOMP16. 5th Int. competition on software verification (SV-COMP16) , 2016 . SVCOMP16. 5th Int. competition on software verification (SV-COMP16), 2016."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322273"}],"event":{"name":"PLDI '17: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Barcelona Spain","acronym":"PLDI '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3062341.3062373","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3062341.3062373","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3062341.3062373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:36:32Z","timestamp":1750203392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3062341.3062373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":41,"alternative-id":["10.1145\/3062341.3062373","10.1145\/3062341"],"URL":"https:\/\/doi.org\/10.1145\/3062341.3062373","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3140587.3062373","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,6,14]]},"assertion":[{"value":"2017-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}