{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T23:16:16Z","timestamp":1715037376143},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0004-3702(94)90063-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"101-157","source":"Crossref","is-referenced-by-count":48,"title":["On proving the termination of algorithms by machine"],"prefix":"10.1016","volume":"71","author":[{"given":"Christoph","family":"Walther","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)90063-9_BIB1","series-title":"Proceedings Third Symposium on Logic in Computer Science","first-page":"336","article-title":"Proving termination properties of PROLOG programs: a semantic approach","author":"Baudinet","year":"1988"},{"key":"10.1016\/0004-3702(94)90063-9_BIB2","series-title":"A Computational Logic","author":"Boyer","year":"1979"},{"issue":"2","key":"10.1016\/0004-3702(94)90063-9_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF00244392","article-title":"The addition of bounded quantification and partial functions to a computational logic and its theorem prover","volume":"4","author":"Boyer","year":"1988","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0004-3702(94)90063-9_BIB4","series-title":"Proceedings IFIP Congress 1974 Stockholm","first-page":"308","article-title":"Program proving as hand simulation with a little induction","author":"Burstall","year":"1974"},{"key":"10.1016\/0004-3702(94)90063-9_BIB5","first-page":"43","article-title":"Programs for mechanical program verification","volume":"6","author":"Cooper","year":"1971"},{"issue":"8","key":"10.1016\/0004-3702(94)90063-9_BIB6","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multiset orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(94)90063-9_BIB7","series-title":"Mathematical Aspects of Computer Science","first-page":"19","article-title":"Assigning meaning to programs","volume":"19","author":"Floyd","year":"1967"},{"key":"10.1016\/0004-3702(94)90063-9_BIB8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","article-title":"Algorithm 65\u2014Find","volume":"12","author":"Hoare","year":"1961","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(94)90063-9_BIB9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00264565","article-title":"A closer look at termination","volume":"5","author":"Katz","year":"1975","journal-title":"Acta Inf."},{"key":"10.1016\/0004-3702(94)90063-9_BIB10","series-title":"Ph.D. Thesis","article-title":"Termination of algorithms","author":"Manna","year":"1968"},{"key":"10.1016\/0004-3702(94)90063-9_BIB11","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"issue":"8","key":"10.1016\/0004-3702(94)90063-9_BIB12","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/355609.362336","article-title":"Inductive methods for proving properties of programs","volume":"16","author":"Manna","year":"1973","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(94)90063-9_BIB13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00288637","article-title":"Axiomatic approach to total correctness of programs","volume":"3","author":"Manna","year":"1974","journal-title":"Acta. Inf."},{"issue":"2","key":"10.1016\/0004-3702(94)90063-9_BIB14","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/359340.359353","article-title":"Is \u201csometimes\u201d sometimes better than \u201calways\u201d?","volume":"21","author":"Manna","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(94)90063-9_BIB15","series-title":"LISP 1.5 Programmer's Manual","author":"McCarthy","year":"1962"},{"issue":"4","key":"10.1016\/0004-3702(94)90063-9_BIB16","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0020-0190(79)90063-2","article-title":"A mechanical proof of the termination of Takeuchi's function","volume":"9","author":"Moore","year":"1979","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/0004-3702(94)90063-9_BIB17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00246023","article-title":"Proving termination of normalization functions for conditional expressions","volume":"2","author":"Paulson","year":"1986","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0004-3702(94)90063-9_BIB18","article-title":"Termination Proofs for Logic Programs","volume":"446","author":"Pl\u00fcmer","year":"1990"},{"key":"10.1016\/0004-3702(94)90063-9_BIB19","series-title":"Proceedings 11th International Conference on Automated Deduction, Saratoga Springs","first-page":"340","article-title":"Disproving conjectures","volume":"607","author":"Protzen","year":"1992"},{"key":"10.1016\/0004-3702(94)90063-9_BIB20","series-title":"Common Lisp\u2014The Language","author":"Steele","year":"1984"},{"issue":"2","key":"10.1016\/0004-3702(94)90063-9_BIB21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","article-title":"Efficient tests for top-down termination of logical rules","volume":"35","author":"Ullman","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(94)90063-9_BIB22","series-title":"Interner Bericht 17\/88","article-title":"Automated termination proofs","author":"Walther","year":"1988"},{"key":"10.1016\/0004-3702(94)90063-9_BIB23","series-title":"Interner Bericht 18\/88","article-title":"A digest of argument-bounded algorithms","author":"Walther","year":"1988"},{"key":"10.1016\/0004-3702(94)90063-9_BIB24","article-title":"Mathematical Induction","volume":"Vol. 2","author":"Walther","year":"1994"},{"key":"10.1016\/0004-3702(94)90063-9_BIB25","series-title":"Automatisierung von Terminierungsbeweisen","author":"Walther","year":"1991"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294900639?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294900639?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:57:06Z","timestamp":1553648226000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294900639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0004370294900639"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)90063-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}