On proving the termination of algorithms by machine
Author:
- Christoph WaltherCWChristoph Walther
- 1 November 1994
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 71 (1) , 101-157
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The addition of bounded quantification and partial functions to a computational logic and its theorem proverJournal of Automated Reasoning, 1988
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Proving termination of normalization functions for conditional expressionsJournal of Automated Reasoning, 1986
- A mechanical proof of the termination of Takeuchi's functionInformation Processing Letters, 1979
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Is “sometime” sometimes better than “always”?Communications of the ACM, 1978
- A closer look at terminationActa Informatica, 1975
- Axiomatic approach to total correctness of programsActa Informatica, 1974
- Inductive methods for proving properties of programsCommunications of the ACM, 1973
- Algorithm 64: QuicksortCommunications of the ACM, 1961