Termination analysis by inductive evaluation

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

Volumn 1421, Issue , 1998, Pages 254-269

  Brauburger, Jürgen ^a   Giesl, Jürgen ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FUNCTION EVALUATION; THEOREM PROVING;

AUTOMATED TERMINATION; AUXILIARY FUNCTIONS; FUNCTIONAL PROGRAMS; IMPERATIVE PROGRAMMING LANGUAGES; NEW APPROACHES; PARTIAL FUNCTIONS; TERMINATION ANALYSIS; WELL-FOUNDED ORDERINGS;

FUNCTIONAL PROGRAMMING;

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

References (30)

1. [AG97] T. Arts and J. Giesl. Proving innermost normalisation automatically. In Proc. RTA-97, Sitges, Spain, LNCS 1232, 1997.
2. [BM79] R.S. Boyer and J S. Moore. A computational logic. Academic Press, 1979.
3. [BR95] A. Bouhoula and M. Rusinowitch. Implicit induction in conditional theories. Journal of Automated Reasoning, 14: 189-235, 1995.
4. 9 as Report IBN-96-33, TU Darmstadt, 1996.
5. 9.
6. [Bra97] J. Brauburger. Automatic termination analysis for partial functions using polynomial orderings. In Proc. 4th SAS, Paris, France, LNCS 1302, 1997.
7. +89] A. Bundy, F. van Harmelen, J. Hesketh, A. Smaill, and A. Stevens. A rational reconstruction and extension of recursion analysis. In Proc. IJCAI '89, Detroit, USA, 1989.
8. [Der87] N. Dershowitz. Termination of rewriting. J. Symb. Comp., 3: 69-115, 1987.
9. [Gie95a] J. Giesl. Generating polynomial orderings for termination proofs. In Proc. RTA-95, Kaiserslautern, Germany, LNCS 914, 1995.
10. [Gie95b] J. Giesl. Automatisierung von Terminierungsbeweisen für rekursiv definierte Algoriťhmen. PhD thesis, Infix-Verlag, St. Augustin, Germany, 1995.
11. [Gie95c] J. Giesl. Termination analysis for functional programs using term orderings. In Proc. 2nd Int. Static Analysis Symp., Glasgow, UK, LNCS 983, 1995.
12. [Gie97] J. Giesl. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 19: 1-29, 1997.
13. [GWB98] J. Giesl, C. Walther, and J. Brauburger. Termination analysis for functional programs. In W. Bibel and P. Schmitt, editors, Automated Deduction-A Basis for Applications, vol. 3. Kluwer Academic Publishers, 1998.
14. [Gri81] D. Gries. The science of programming. Springer-Verlag, New York, 1981.
15. [Hen80] P. Henderson. Functional programming. Prentice-Hall, London, 1980.
16. [HS96] D. Hutter and C. Sengler. INKA: The next generation. In Proc. CADE-13, New Brunswick, USA, LNAI 1104, 1996.
17. [KZ95] D. Kapur and H. Zhang. An overview of Rewrite Rule Laboratory (RRL). J. Computer Math. Appl., 29: 91-114, 1995.
18. [Lan79] D.S. Lankford. On proving term rewriting systems are noetherian. Memo MTP-3, Math. Dept., Louisiana Tech. Univ., Ruston, USA, 1979.
19. [NN96] F. Nielson and H.R. Nielson. Operational semantics of termination types. Nordic Journal of Computing, 3(2): 144-187, 1996.
20. [PS97] S.E. Panitz and M. Schmidt-Schauβ. TEA: Automatically proving termination of programs in a non-strict higher-order functional language. In Proc. 4th Int. Static Analysis Symp., Paris, France, LNCS 1302, 1997.
21. [P1Ü90] L. Pliimer. Termination proofs for logic programs. LNAI 446, 1990.
22. [Pro96] M. Protzen. Patching faulty conjectures. In Proc. CADE-13, LNAI 1104, New Brunswick, USA, 1996.
23. [SD94] D. De Schreye and S. Decorte. Termination of logic programs: The never-ending story. Journal of Logic Programming, 19/20: 199-260, 1994.
24. [Sen96] C. Sengler. Termination of algorithms over non-freely generated data types. In Proc. CADE-13, New Brunswick, USA, LNAI 1104, 1996.
25. [Ste94] J. Steinbach. Generating polynomial orderings. IPL, 49: 85-93, 1994.
26. [Ste95] J. Steinbach. Simplification orderings: History of results. Pundamenta In-formaticae, 24: 47-87, 1995.
27. [UvG88] J.D. Ullman and A. van Gelder. Efficient tests for top-down termination of logical rules. Journal of the ACM, 35(2): 345-373, 1988.
28. [Wal94a] C. Walther. Mathematical induction. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2. Oxford University Press, 1994.
29. [Wal94b] C. Walther. On proving the termination of algorithms by machine. Artificial Intelligence, 71(1): 101-157, 1994.
30. [ZKK88] H. Zhang, D. Kapur, and M.S. Krishnamoorthy. A mechanizable induction principle for equational specifications. In Proc. CADE-9, Argonne, USA, LNCS 310, 1988.