Reasoning about incompletely defined programs

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

Volumn 3835 LNAI, Issue , 2005, Pages 427-442

  Walther, Christoph ^a   Schweitzer, Stephan ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED REASONING; ERROR MESSAGE; FUNCTIONAL PROGRAMS;

ARTIFICIAL INTELLIGENCE; COMPUTER AIDED SOFTWARE ENGINEERING; ERROR ANALYSIS; FUNCTIONS; PROBLEM SOLVING;

LOGIC PROGRAMMING;

EID: 33745458400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_30     Document Type: Conference Paper

References (27)

1. http://www.verifun.org.
2. R. D. Arthan. Undefinedness in Z: Issues for Specification and Proof. In Proc. CADE 13 Workshop on Mechanization of Partial Functions, available from http://www.cs.bham.ac.uk/~mmk/cade96-partiality/. New Brunswick, NJ, 1996.
3. S. Autexier, D. Hutter, H. Mantel, and A. Schairer. inka 5.0 - A Logic Voyager. In H. Ganzinger, editor, Proc. 16th Inter. Conf. on Autom. Deduction (CADE-16), volume 1632 of Lect. Notes in Artif. Intell., pages 207-211, Trento, 1999. Springer.
4. R. S. Boyer and J. S. Moore. A Computational Logic. Acad. Press, NY, 1979.
5. A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam System. In M. Stickel, editor, Proc. of the 10th Inter. Conf. on Autom. Deduction, volume 449 of Lect. Notes in Artif. Intell., pages 647-648, Kaiserslautern, 1990. Springer.
6. H. Comon. Inductionless Induction. In A. Robinson and A. Voronkov, editors, Handb. of Autom. Reasoning., volume I, chapter 14, pages 913-962. Elsevier, 2001.
7. W. M. Farmer. Mechanizing the Traditional Approach to Partial Functions. In Proc. CADE 13 Workshop on Mechanization of Partial Functions, available from http://www.cs.bham.ac.uk/~mmk/cade96-partiality/. New Brunswick, NJ, 1996.
8. S. Finn, M. P. Fourmann, and J. Longley. Partial Functions in a Total Setting. Journal of Automated Reasoning, 18:85-104, 1997.
9. J. Giesl. Induction Proofs with Partial Functions. J. Aut. Reason., 26:1-49, 2001.
10. 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, volume 3, pages 135-164. Kluwer Acad. Publ., Dordrecht, 1998.
11. D. Gries and F. B. Schneider. Avoiding the Undefined by Underspecification. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 366-373. Springer, 1995.
12. C. B. Jones. Partial functions and logics: A warning. Information Processing Letters, 54(2), 1995.
13. C. B. Jones. TANSTAAFL (with partial functions). In Proc. Workshop on Mechanization of Partial Functions, CADE 13, available from http://www.cs.bham. ac.uk/~mmk/cade96-partiality/. New Brunswick, NJ, 1996.
14. D. Kapur. Constructors Can Be Partial, Too. In R. Veroff, editor, Automated Reasoning and Its Applications - Essays in Honor of Larry Wos, pages 177-210. The MIT Press, Cambridge,MA, 1997.
15. D. Kapur and D. R. Musser. Inductive Reasoning with Incomplete Specifications. In Symposium on Logic in Computer Science, volume 720, pages 367-377, Cambridge, MA, 1986. IEEE Computer Society.
16. D. Kapur and D. R. Musser. Proof by Consistency. Artificial Intelligence, 31(2):125-157, 1987.
17. D. Kapur and M. Subramaniam. New Uses of Linear Arithmetic in Automated Theorem Proving by Induction. J. Automated Reasoning, 16(1-2):39-78, 1996.
18. M. Kaufmann and J. S. Moore. ACL2: An Industrial Strength Version of NQTHM. In Compass'96: 11th Annual Conf. on Computer Assurance, Gaithersburg, Maryland, 1996. National Institute of Standards and Technology.
19. J. Loeckx, H.-D. Ehrich, and M. Wolf. Specification of Abstract Data Types. Wiley-Teubner, New York, Stuttgart, 1996.
20. P. Manolios and J. S. Moore. Partial Functions in ACL2. Journal of Automated Reasoning, 31:107-127, 2003.
21. B. Schieder and M. Broy. Adapting Calculational Logic to the Undefined. The Computer Journal, 42(2):73-81, 1999.
22. C. Walther. On Proving the Termination of Algorithms by Machine. Artificial Intelligence, 71(1):101-157, 1994.
23. C. Walther and S. Schweitzer. About VeriFun. In F. Baader, editor, Proc. of the 19th Inter. Conf. on Automated Deduction (CADE-19), volume 2741 of Lecture Notes in Artifical Intelligence, pages 322-327, Miami Beach, 2003. Springer.
24. C. Walther and S. Schweitzer. Automated Termination Analysis for Incompletely Defined Programs. Technical Report VFR 04/03, Programmiermethodik, Technische Universität Darmstadt, 2004.
25. C. Walther and S. Schweitzer. Reasoning about Incompletely Defined Programs. Technical Report VFR 04/02, Programmiermethodik, Technische Universität Darmstadt, 2004.
26. C. Walther and S. Schweitzer. Verification in the Classroom. Journal of Automated Reasoning - Special Issue on Automated Reasoning and Theorem Proving in Education, 32(1):35-73, 2004.
27. C. Walther and S. Schweitzer. Automated Termination Analysis for Incompletely Defined Programs. In F. Baader and A. Voronkov, editors, Proc. of the 11th Inter. Conf. on Logic for Progr., Artif. Intell. and Reasoning (LPAR-11), volume 3452 of Lect. Notes in Artif. Intell., pages 332-346, Montevideo, Uruguay, 2005. Springer.