Inductive invariants for nested recursion

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

Volumn 2758, Issue , 2003, Pages 253-269

  Krstić, Sava ^a   Matthews, John ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; MACHINERY;

FIXPOINTS; FUNCTION DEFINITIONS; HIGHER ORDER LOGIC; INPUT-OUTPUT RELATIONS; NESTED RECURSION; PARTIAL FUNCTIONS; TERMINATION PROOF;

RECURSIVE FUNCTIONS;

EID: 35248837002     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10930755_17     Document Type: Article

References (22)

1. H. R. Andersen. An Introduction to Binary Decision Diagrams (Lecture Notes). www.itu.dk/people/hra/bdd97.ps.gz, October 1997.
2. A. Balaa and Y. Bertot. Fonctions récursives générales par itération en théorie des types. In Journées francophones des langages applicatifs, JFLA'02. INRIA, 2002.
3. Y. Bertot, V. Capretta, and K. D. Barman. Type-theoretic functional semantics. In V. A Carreno, C. A. Munoz, and S. Tahar, editors, Theorem Proving in Higher Order Logics (TPHOLS 2002), volume 2410 of LNCS, pages 83-98. Springer, 2002.
4. A. Bove and V. Capretta. Nested general recursion and partiality in type theory. In R. J. Boulton and P. B. Jackson, editors, Theorem Proving in Higher Order Logics (TPHOLS 2001), volume 2152 of LNCS, pages 121-135. Springer, 2001.
5. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
6. J. Giesl. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 19(1):1-29, 1997.
7. J. Harrison. Inductive definitions: Automation and application. In E. T. Schubert, P. J. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and Its Applications, pages 200-213. Springer, Berlin, 1995.
8. F. W. von Henke et al. Case Studies in Meta-Level Theorem Proving. In J. Grundy and M. Newey, editors, Theorem Proving in Higher Order Logics (TPHOLS 1998), volume 1749 of LNCS, pages 461-478. Springer, 1998.
9. S. Krstić and J. Matthews. Verifying BDD algorithms through monadic interpretation. In A. Cortesi, editor, Verification, Model Checking, and Abstract Interpretation (VMCAI 2002), volume 2294 of LNCS, pages 182-195. Springer, 2002.
10. Z. Manna and A. Shamir. The optimal approach to recursive programs. Communications of the ACM, 20(11):824-831, 1977.
11. J. Matthews. Recursive function definition over coinductive types. In Y. Bertot et al., editor, Theorem Proving in Higher Order Logics (TPHOLS 1999), volume 1690 of LNCS, pages 73-90. Springer, 1999.
12. J. S. Moore. A mechanical proof of the termination of Takeuchi's function. Information Processing Letters, 9:176-181, 1979.
13. O. Müller, T. Nipkow, D. von Oheimb, and O. Slotosch. HOLCF = HOL + LCF. Journal of Functional Programming, 9:191-223, 1999.
14. O. Müller and K. Slind. Treating partiality in a logic of total functions. The Computer Journal, 40(10), 1997.
15. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
16. L. C. Paulson. Proving termination of normalization functions for conditional expressions. Journal of Automated Reasoning, 2(1):63-74, 1986.
17. K. Slind. Function definition in higher order logic. In J. von Wright et al., editor, Theorem Proving in Higher Order Logics (TPHOLS 1996), volume 1125 of LNCS, pages 381-397. Springer, 1996.
18. K. Slind. Reasoning about Terminating Functional Programs. PhD thesis, Institut für Informatik, Technische Universität München, 1999.
19. K. Slind. Another look at nested recursion. In M. Aagaard and J. Harrison, editors, Theorem Proving in Higher Order Logics (TPHOLS 2000), volume 1869 of LNCS, pages 498-518. Springer, 2000.
20. R. Sumners. Correctness proof of a BDD manager in the context of satisfiability checking. Technical Report TR-00-29, The University of Texas at Austin, Department of Computer Sciences, 2000.
21. K. N. Verma et al. Reflecting BDDs in Coq. In J. He and M. Sato, editors, Proc. 6th Asian Computing Science Conference (ASIAN), volume 1961 of LNCS, pages 162-181. Springer, 2000.
22. G. Winskel. The Formal Semantics of Programming Languages: an Introduction. MIT Press, 1993.