{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:52:18Z","timestamp":1742935938282,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367410"},{"type":"electronic","value":"9783642367427"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36742-7_18","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:41:56Z","timestamp":1361216516000},"page":"245-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Underapproximation of Procedure Summaries for Integer Programs"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Ganty","sequence":"first","affiliation":[]},{"given":"Radu","family":"Iosif","sequence":"additional","affiliation":[]},{"given":"Filip","family":"Kone\u010dn\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Termination Competition 2011, \n                    \n                      http:\/\/termcomp.uibk.ac.at\/termcomp\/home.seam"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-27940-9_4","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Albarghouthi","year":"2012","unstructured":"Albarghouthi, A., Gurfinkel, A., Chechik, M.: Whale: An Interpolation-Based Algorithm for Inter-procedural Verification. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol.\u00a07148, pp. 39\u201355. Springer, Heidelberg (2012)"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R. Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. JACM\u00a056(3), 16 (2009)","journal-title":"JACM"},{"key":"18_CR4","unstructured":"Atig, M.F., Ganty, P.: Approximating petri net reachability along context-free traces. In: FSTTCS 2011. LIPIcs, vol.\u00a013, pp. 152\u2013163. Schloss Dagstuhl (2011)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10703-009-0087-8","volume":"35","author":"B. Cook","year":"2009","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Summarization for termination: no return! Formal Methods in System Design\u00a035, 369\u2013387 (2009)","journal-title":"Formal Methods in System Design"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-45069-6_12","volume-title":"Computer Aided Verification","author":"S. Bardin","year":"2003","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast Acceleration of Symbolic Transition Systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 118\u2013121. Springer, Heidelberg (2003)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-14295-6_23","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"2010","unstructured":"Bozga, M., Iosif, R., Kone\u010dn\u00fd, F.: Fast Acceleration of Ultimately Periodic Relations. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 227\u2013242. Springer, Heidelberg (2010)"},{"issue":"2","key":"18_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.3233\/FI-2009-0044","volume":"91","author":"M. Bozga","year":"2009","unstructured":"Bozga, M., Iosif, R., Lakhnech, Y.: Flat parametric counter automata. Fundamenta Informaticae\u00a091(2), 275\u2013303 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Cowles, J.: Knuth\u2019s generalization of McCarthy\u2019s 91 function. In: Computer-aided Reasoning, pp. 283\u2013299 (2000)","DOI":"10.1007\/978-1-4757-3188-0_17"},{"issue":"6","key":"18_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1857914.1857917","volume":"57","author":"J. Esparza","year":"2010","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Newtonian program analysis. JACM 57(6), 33:1\u201333:47 (2010)","journal-title":"JACM"},{"key":"18_CR11","unstructured":"Ganty, P., Iosif, R., Kone\u010dn\u00fd, F.: Underapproximation of procedure summaries for integer programs. CoRR abs\/1210.4289 (2012)"},{"key":"18_CR12","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, Inc., New York (1966)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Nori, A.V., Rajamani, S.K., Tetali, S.: Compositional may-must program analysis: unleashing the power of alternation. In: POPL 2010, pp. 43\u201356. ACM (2010)","DOI":"10.1145\/1707801.1706307"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-03237-0_22","volume-title":"Static Analysis","author":"G. Godoy","year":"2009","unstructured":"Godoy, G., Tiwari, A.: Invariant Checking for Programs with Procedure Calls. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol.\u00a05673, pp. 326\u2013342. Springer, Heidelberg (2009)"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/S0019-9958(71)90095-7","volume":"19","author":"J. Gruska","year":"1971","unstructured":"Gruska, J.: A few remarks on the index of context-free grammars and languages. Information and Control\u00a019(3), 216\u2013223 (1971)","journal-title":"Information and Control"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-32759-9_21","volume-title":"FM 2012: Formal Methods","author":"H. Hojjat","year":"2012","unstructured":"Hojjat, H., Kone\u010dn\u00fd, F., Garnier, F., Iosif, R., Kuncak, V., R\u00fcmmer, P.: A Verification Toolkit for Numerical Transition Systems - Tool Paper. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol.\u00a07436, pp. 247\u2013251. Springer, Heidelberg (2012)"},{"key":"18_CR17","unstructured":"Lalire, G., Argoud, M., Jeannet, B.: Interproc., \n                    \n                      http:\/\/pop-art.inrialpes.fr\/people\/bjeannet\/bjeannet-forge\/interproc\/index.html"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/S0019-9958(78)91015-X","volume":"39","author":"M. Luker","year":"1978","unstructured":"Luker, M.: A family of languages having only finite-index grammars. Information and Control\u00a039(1), 14\u201318 (1978)","journal-title":"Information and Control"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01744305","volume":"13","author":"M. Luker","year":"1980","unstructured":"Luker, M.: Control sets on grammars using depth-first derivations. Mathematical Systems Theory\u00a013, 349\u2013359 (1980)","journal-title":"Mathematical Systems Theory"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995, pp. 49\u201361. ACM (1995)","DOI":"10.1145\/199448.199462"},{"key":"18_CR21","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, ch.\u00a07, pp. 189\u2013233. Prentice-Hall, Inc. (1981)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36742-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:03:15Z","timestamp":1590969795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36742-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367410","9783642367427"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36742-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}