Automated termination analysis for incompletely defined programs

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

Volumn 3452 LNAI, Issue , 2005, Pages 332-346

  Walther, Christoph ^a   Schweitzer, Stephan ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; ERROR ANALYSIS; PROBLEM SOLVING;

AUTOMATED TERMINATION ANALYSIS; ERROR MESSAGE; RUN TIME ERROR;

COMPUTER PROGRAM LISTINGS;

EID: 26844536626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_22     Document Type: Conference Paper

References (28)

1. Boyer, R.S., Moore, J.S.: A Computational Logic. Acad. Press, NY (1979)
2. Giesl, J.: Termination Analysis for Functional Programs using Term Orderings. In: Proc. of the 2nd Intern. Static Analysis Symposium (SAS-95). Volume 983 of Lecture Notes in Artifical Intelligence., Glasgow, Springer (1995) 154-171
3. Giesl, J.: Termination of Nested and Mutually Recursive Algorithms. Journal of Automated Reasoning 19 (1997) 1-29
4. Giesl, J., Walther, C., Brauburger, J.: Termination Analysis for Functional Programs. In Bibel, W., Schmitt, P., eds.: Automated Deduction - A Basis for Applications. Volume 3. Kluwer Acad. Publ., Dordrecht (1998) 135-164
5. Kamareddine, F., Monin, F.: An extension of an automated termination method of recursive functions. Intern. J. of Found, of Comp. Sc. 13 (2002) 361-386
6. Manoury, P., Simonot, M.: Automatizing Termination Proofs of Recursively Defined Functions. Theoretical Computer Science 135 (1994) 319-343
7. Monin, F., Simonot, M.: An Ordinal Measure based Procedure for Termination of Functions. Theoretical Computer Science 254 (2001) 63-94
8. Nielson, F., Nielson, H.R.: Termination Analysis based on Operational Semantics. Technical report, Aarhus University, Denmark (1995)
9. Sengler, C.: Termination of Algorithms over Non-Freely Generated Data Types. In McRobbie, M.A., Slaney, J.K., eds.: Proc. of the 13th Inter. Conf. on Automated Deduction (CADE-13). Volume 1104 of Lecture Notes in Artifical Intelligence., New Brunswick, NJ, Springer (1996) 121-136
10. Walther, C.: On Proving the Termination of Algorithms by Machine. Artificial Intelligence 71 (1994) 101-157
11. http://www.verifun.de.
12. Walther, C., Schweitzer, S.: About VeriFun. In Baader, F., ed.: Proc. of the 19th Inter. Conf. on Automated Deduction (CADE-19). Volume 2741 of Lecture Notes in Artifical Intelligence., Miami Beach, Springer (2003) 322-327
13. Walther, C., Schweitzer, S.: Verification in the Classroom. Journal of Automated Reasoning - Special Issue on Automated Reasoning and Theorem Proving in Education 32 (2004) 35-73
14. Walther, C., Schweitzer, S.: Reasoning about Incompletely Defined Programs. Technical Report VFR 04/02, Programmiermethodik, Technische Universität Darmstadt (2004)
15. Bundy, A.: The Automation of Proof by Mathematical Induction. In Robinson, A., Voronkov, A., eds.: Handbook of Automated Reasoning. Volume I. Elsevier (2001) 845-911
16. Comon, H.: Inductionless Induction. In Robinson, A., Voronkov, A., eds.: Handb. of Autom. Reasoning. Volume I. Elsevier (2001) 913-962
17. Walther, C.: Mathematical Induction. In Gabbay, D., Hogger, C., Robinson, J., eds.: Handbook of Logic in Artificial Intelligence and Logic Programming. Volume 2. Oxford University Press, Oxford (1994) 127-228
18. Autexier, S., Hutter, D., Langenstein, B., Mantel, H., Rock, G., Schairer, A., Stephan, W., Vogt, R., Wolpers, A.: VSE: Formal Methods Meet Industrial Needs. Intern. J. on Software Tools for Technology Transfer 3 (2000) 66-77
19. Autexier, S., Hutter, D., Mantel, H., Schairer, A.: inka 5.0 - A Logic Voyager. In Ganzinger, H., ed.: Proc. 16th Inter. Conf. on Autom. Deduction (CADE-16). Volume 1632 of Lect. Notes in Artif. Intell., Trento, Springer (1999) 207-211
20. Hutter, D., Langenstein, B., Sengler, C., Siekmann, J., Stephan, W., Wolpers, A.: Verification Support Environment (VSE). High Integrity Syst. 1 (1996) 523-530
21. Hutter, D., Sengler, C.: INKA: The Next Generation. In McRobbie, M., J.Slaney, eds.: Proc. 13th Inter. Conf. on Autom. Deduction (CADE-13). Volume 1104 of Lect. Notes in Artif. Intell., New Brunswick, Springer (1996) 288-292
22. Brauburger, J.: Automatic Termination Analysis for Partial Functions using Polynomial Orderings. In: Proc. of the 4th Intern. Static Analysis Symposium (SAS-97). Volume 1302 of Lect. Notes in Artif. Intell., Paris, Springer (1997) 330-344
23. Brauburger, J., Giesl, J.: Approximating the Domains of Functional and Imperative Programs. Science of Computer Programming 35 (1999) 113-136
24. Giesl, J.: Automated Termination Proofs with Measure Functions. In: Proc. of the 19th Annual German Conf. on Artifical Intelligence (KI-95). Volume 981 of Lecture Notes in Artifical Intelligence., Bielefeld, Springer (1995) 149-160
25. Gow, J., Bundy, A., Green, I.: Extensions to the Estimation Calculus. In Ganzinger, H., McAllester, D.A., Voronkov, A., eds.: Proc. of the 6th Inter. Conf. on Logic Progr. and Autom. Reasoning (LPAR-6). Volume 1705 of Lect. Notes in Artif. Intelligence., Tbilisi, Georgia, Springer (1999) 258-272
26. Hutter, D.: Using Rippling to Prove the Termination of Algorithms. Technical Report RR 97-03, DFKI, Saarbrücken (1997)
27. McAllester, D., Arkoudas, K.: Walther Recursion. In McRobbie, M.A., Slaney, J.K., eds.: Proc. of the 13th Inter. Conf. on Autom. Deduction. Volume 1104 of Lect. Notes in Artif. Intell., New Brunswick, NJ, Springer (1996) 643-657
28. Walther, C., Schweitzer, S.: Automated Termination Analysis for Incompletely Defined Programs. Technical Report VFR 04/03, Programmiermethodik, Technische Universität Darmstadt (2004)