{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:38Z","timestamp":1742617238144,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:19:46Z","timestamp":1330294786000},"page":"113-127","source":"Crossref","is-referenced-by-count":5,"title":["Termination analysis for partial functions"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Brauburger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Giesl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"9_CR1","unstructured":"J. Brauburger & J. Giesl. Termination Analysis for Partial Functions. Technical Report IBN 96\/33, TH Darmstadt, 1996. Available from http:\/\/kirmes. inferenzsysteme.informatik.th-darmstadt.de\/~report\/ibn-96-33.ps.gz."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"[Bi+86] S. Biundo, B. Hummel, D. Hutter & C. Walther. The Karlsruhe Induction Theorem Proving System. Pr. 8th CADE, LNCS 230, Oxford, England, 1986.","DOI":"10.1007\/3-540-16780-3_132"},{"key":"9_CR3","unstructured":"R. S. Boyer & J S. Moore. A Computational Logic. Academic Press, 1979."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF00244392","volume":"4","author":"R. S. Boyer","year":"1988","unstructured":"R. S. Boyer & J. S. Moore. The Addition of Bounded Quantification and Partial Functions to A Computational Logic and Its Theorem Prover. Journal of Automated Reasoning, 4:117\u2013172, 1988.","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"[Bu+90] A. Bundy, F. van Harmelen, C. Horn & A. Smaill. The Oyster-Clam System. In Proc. 10th CADE, LNAI 449, Kaiserslautern, Germany, 1990.","DOI":"10.1007\/3-540-52885-7_123"},{"issue":"1","key":"9_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of Rewriting. Journal of Symbolic Computation, 3(1, 2):69\u2013115, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"J. Giesl. Generating Polynomial Orderings for Termination Proofs. Pr. 6th Int. Conf. Rewr. Tech. & App., LNCS 914, Kaiserslautern, Germany, 1995.","DOI":"10.1007\/3-540-59200-8_77"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"J. Giesl. Automated Termination Proofs with Measure Functions. In Proc. 19th Annual German Conf. on AI, LNAI 981, Bielefeld, Germany, 1995.","DOI":"10.1007\/3-540-60343-3_33"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"J. Giesl. Termination Analysis for Functional Programs using Term Orderings. Pr. 2nd Int. Stat. Analysis Symp., LNCS 983, Glasgow, Scotland, 1995.","DOI":"10.1007\/3-540-60360-3_38"},{"key":"9_CR10","unstructured":"J. Giesl. Termination of Nested and Mutually Recursive Algorithms. Journal of Automated Reasoning, 1996. To appear."},{"key":"9_CR11","volume-title":"Functional Programming","author":"P. Henderson","year":"1980","unstructured":"P. Henderson. Functional Programming. Prentice-Hall, London, 1980."},{"key":"9_CR12","unstructured":"C. K. Holst. Finiteness Analysis. In Proc. 5th ACM Conf. Functional Prog. Languages & Comp. Architecture, LNCS 523, Cambridge, MA, USA, 1991."},{"key":"9_CR13","unstructured":"Z. Manna. Mathematical Theory of Computation. McGraw-Hill, 1974."},{"key":"9_CR14","volume-title":"Technical Report","author":"F. Nielson","year":"1995","unstructured":"F. Nielson & H. R. Nielson. Termination Analysis based on Operational Semantics. Technical Report, Aarhus University, Denmark, 1995."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"L. Pl\u00fcmer. Termination Proofs for Logic Programs. LNAI 446, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"issue":"20","key":"9_CR16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. Schreye De","year":"1994","unstructured":"D. De Schreye & S. Decorte. Termination of Logic Programs: The Never-Ending Story. Journal of Logic Programming 19,20:199\u2013260, 1994.","journal-title":"Journal of Logic Programming"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/FI-1995-24123","volume":"24","author":"J. Steinbach","year":"1995","unstructured":"J. Steinbach. Simplification Orderings: History of Results. Fundamenta Informaticae 24:47\u201387, 1995.","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"9_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J. D. Ullman","year":"1988","unstructured":"J. D. Ullman & A. van Gelder. Efficient Tests for Top-Down Termination of Logical Rules. Journal of the ACM, 35(2):345\u2013373, 1988.","journal-title":"Journal of the ACM"},{"key":"9_CR19","unstructured":"C. Walther. Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. In Proc. 9th CADE, LNCS 310, Argonne, IL, 1988."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"C. Walther. Mathematical Induction. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2, Oxford University Press, 1994.","DOI":"10.1093\/oso\/9780198537465.003.0003"},{"issue":"1","key":"9_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0004-3702(94)90063-9","volume":"71","author":"C. Walther","year":"1994","unstructured":"C. Walther. On Proving the Termination of Algorithms by Machine. Artificial Intelligence, 71(1):101\u2013157, 1994.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:25:13Z","timestamp":1742599513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}