Automating induction over mutually recursive functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1101, Issue , 1996, Pages 117-131

  Kapur, Deepak ^a   Subramaniam, M ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SOFTWARE ENGINEERING; THEOREM PROVING;

ARITHMETIC EXPRESSION; BOTTOM-UP EVALUATIONS; EQUATIONAL SPECIFICATIONS; FUNCTION DEFINITIONS; INDUCTION HYPOTHESIS; INDUCTION METHOD; RECURSIVE DEFINITIONS; USER INTERVENTION;

RECURSIVE FUNCTIONS;

EID: 84886703490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014311     Document Type: Conference Paper

References (14)

1. A. Bouhoula, Private Communication, March 1996.
2. A. Bouhoula, "Using Induction and Rewriting to Verify and Complete Parameterized Specifications," To appear in Theoretical Computer Science, Dec. 1996.
3. A. Bouhoula and M. Rusinowitch, "Implicit induction in conditional theories," Journal of Automated Reasoning, 1995.
4. R.S. Boyer and M. Kaufmann, Private Communication, March 1995.
5. R.S. Boyer and J S. Moore, A Computational Logic. ACM Monographs in Computer Sc., 1979.
6. R.S. Boyer and J. S. Moore, A Computational Logic Handbook. New York: Academic Press, 1988.
7. F. Bronsard, U. Reddy and R.W. Hasker, "Induction using term orderings," Proc. 12th International Conference on Automated Deduction (CADE-12), Nancy, France, July 1994.
8. N. Dershowitz, "Termination of rewriting," J. of Symbolic Computation, 3, 69-116, 1987.
9. D.Kapur and D.R. Musser, "Proof by Consistency," AI Journal, 31(2):125-157, Feb. 1987.
10. D. Kapur and X. Nie, "Reasoning about numbers in Tecton," Proc. of ISMIS'94, October 1994.
11. D. Kapur and M. Subramaniam, "Using linear arithmetic procedure for generating Induction Schemes," Proc. Foundations of Software Technology and Theoretical Computer Science (FSTTCS-14) (ed: Thiagarajan), LNCS, Dec. 1994.
12. Deepak Kapur and M. Subramaniam, " Automating Inductions over Mutual Recursive Functions," CS Dept. Tech. Report, March. 1996.
13. D. Kapur and H. Zhang, "An overview of Rewrite Rule Laboratory (RRL)," J. of Computer and Mathematics with Applications, 29, 2, 1995, 91-114. Earlier descriptions in CADE-88 and RTA-89.
14. H. Zhang, D. Kapur, and M.S. Krishnamoorthy, "A mechanizable induction principle for equational specifications," Proc. Ninth International Conference on Automated Deduction (CADE-9), Argonne, IL, LNCS 310, 162-181, 1988.