{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:40:42Z","timestamp":1759826442464},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540374060"},{"type":"electronic","value":"9783540374114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817963_36","type":"book-chapter","created":{"date-parts":[[2006,8,5]],"date-time":"2006-08-05T05:07:51Z","timestamp":1154754471000},"page":"401-414","source":"Crossref","is-referenced-by-count":54,"title":["Termination Analysis with Calling Context Graphs"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Manolios","sequence":"first","affiliation":[]},{"given":"Daron","family":"Vroon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"36_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/278283.278285","volume":"33","author":"A.W. Appel","year":"1998","unstructured":"Appel, A.W.: SSA is functional programming. SIGPLAN Not.\u00a033(4), 17\u201320 (1998)","journal-title":"SIGPLAN Not."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: Termination of polynomial programs. In: Cousot [7], pp. 113\u2013129","key":"36_CR3","DOI":"10.1007\/978-3-540-30579-8_8"},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M., Taboch, C.: A semantic basis for the termination analysis of logic programs. The Journal of Logic Programming\u00a041(1), 103\u2013123 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11547662_8","volume-title":"Static Analysis","author":"B. Cook","year":"2005","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Abstraction refinement for termination. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 87\u2013102. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P.: Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In: Cousot [7], pp. 1\u201324","key":"36_CR6","DOI":"10.1007\/978-3-540-30579-8_1"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Verification, Model Checking, and Abstract Interpretation","year":"2005","unstructured":"Cousot, R. (ed.): VMCAI 2005. LNCS, vol.\u00a03385. Springer, Heidelberg (2005)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"volume-title":"Computer-Aided Reasoning: ACL2 Case Studies","year":"2000","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S. (eds.): Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers, Dordrecht (2000)","key":"36_CR9"},{"key":"36_CR10","volume-title":"Computer-Aided Reasoning: An Approach","author":"M. Kaufmann","year":"2000","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, Dordrecht (2000)"},{"unstructured":"Kaufmann, M., Moore, S.: ACL2 homepage, See: http:\/\/www.cs.-utexas.edu\/users\/moore\/acl2","key":"36_CR11"},{"issue":"2","key":"36_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1026517200045","volume":"26","author":"M. Kaufmann","year":"2001","unstructured":"Kaufmann, M., Moore, J.S.: Structured theory development for a mechanized logic. J. Autom. Reason.\u00a026(2), 161\u2013203 (2001)","journal-title":"J. Autom. Reason."},{"key":"36_CR13","first-page":"81","volume-title":"ACM Symposium on Principles of Programming Languages","author":"C.S. Lee","year":"2001","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: ACM Symposium on Principles of Programming Languages, vol.\u00a028, pp. 81\u201392. ACM Press, New York (2001)"},{"doi-asserted-by":"crossref","unstructured":"Manolios, P., Vroon, D.: Ordinal arithmetic: Algorithms and mechanization. Journal of Automated Reasoning (to appear)","key":"36_CR14","DOI":"10.1007\/s10817-005-9023-9"},{"key":"36_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-45085-6_19","volume-title":"Automated Deduction \u2013 CADE-19","author":"P. Manolios","year":"2003","unstructured":"Manolios, P., Vroon, D.: Algorithms for ordinal arithmetic. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 243\u2013257. Springer, Heidelberg (2003)"},{"unstructured":"Manolios, P., Vroon, D.: Ordinal arithmetic in ACL2. In: Kaufmann, M., Moore, J.S. (eds.) Fourth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2003) (July 2003), http:\/\/www.cs.utexas.edu\/-users\/moore\/acl2\/workshop-2003\/","key":"36_CR16"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-30494-4_7","volume-title":"Formal Methods in Computer-Aided Design","author":"P. Manolios","year":"2004","unstructured":"Manolios, P., Vroon, D.: Integrating reasoning about ordinal arithmetic into ACL2. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol.\u00a03312, pp. 82\u201397. Springer, Heidelberg (2004)"},{"key":"36_CR18","volume-title":"ICSE 2006, The 28th international Conference on Softwar Engineering, Emerging Results","author":"P. Manolios","year":"2006","unstructured":"Manolios, P., Vroon, D.: Integrating static analysis and general-purpose theorem proving for termination analysis. In: ICSE 2006, The 28th international Conference on Softwar Engineering, Emerging Results. ACM Press, New York (2006)"},{"key":"36_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24622-0_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 239\u2013251. Springer, Heidelberg (2004)"},{"key":"36_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-27813-9_6","volume-title":"Computer Aided Verification","author":"A. Tiwari","year":"2004","unstructured":"Tiwari, A.: Termination of linear programs. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 70\u201382. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Turing, A.: On computable numbers, with an application to the entscheidungs problem. In: Proceedings of the London Mathematical Society, vol.\u00a042 of Series 2, pp. 230\u2013265 (1936)","key":"36_CR21","DOI":"10.1112\/plms\/s2-42.1.230"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817963_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:00Z","timestamp":1605644160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817963_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374060","9783540374114"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11817963_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}