Improvements in formula generalization

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

Volumn 4603 LNAI, Issue , 2007, Pages 231-246

  Aderhold, Markus ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; HEURISTIC ALGORITHMS; VERIFICATION;

FUNCTION SYMBOLS; INDUCTION HYPOTHESES; VERIFUN;

THEOREM PROVING;

EID: 35148821900     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73595-3_16     Document Type: Conference Paper

References (18)

1. http://www.verifun.org
2. Aderhold, M.: Formula generalization in VeriFun. Diploma thesis, Technische Universität Darmstadt (2004)
3. Aderhold, M., Walther, C., Szallies, D., Schlosser, A.: A fast disprover for VeriFun. In: Ahrendt, W., Baumgartner, P., de Nivelle, H. (eds.) Proc. of the 3rd Workshop on Disproving, pp. 59-69 (2006)
4. Aubin, R.: Mechanizing Structural Induction. PhD thesis, University of Edinburgh (1976)
5. Boyer, R.S., Moore, J S.: A Computational Logic. Academic Press, San Diego (1979)
6. Bundy, A.: The automation of proof by mathematical induction. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning (chapter 13), vol. I, pp. 845-911. Elsevier, Amsterdam (2001)
7. Bundy, A., Basin, D., Hutter, D., Ireland, A.: Rippling: Meta-Level Guidance for Mathematical Reasoning (chapter 3). In: Cambridge Tracts in Theoretical Computer Science, no. 56, Cambridge University Press, Cambridge (2005)
8. Dixon, L.: A Proof Planning Framework For Isabelle. PhD thesis, University of Edinburgh (2005)
9. Hummel, B.: Generierung von Induktionsformeln und Generalisierung beim automatischen Beweisen mit vollständiger Induktion. Doctoral dissertation, Universität Karlsruhe (1990)
10. Kapur, D.: Theorem proving support for hardware verification. In: Third Intl. Workshop on First-Order Theorem Proving, (2000) Invited talk, paper available at http://www.cs.unm.edu/~kapur/myabstracts/tphardware00.html
11. Kapur, D., Subramaniam, M.: Lemma discovery in automating induction. In: McRobbie, M.A., Slaney, J.K. (eds.) Automated Deduction - CADE-13. LNCS, vol. 1104, pp. 538-552. Springer, Heidelberg (1996)
12. Owre, S., Rushby, J., Shankar, N.: PVS: A prototype verification system. In: Kapur, D. (ed.) Automated Deduction - CADE-11. LNCS, vol. 607, pp. 748-752. Springer, Heidelberg (1992)
13. Schweitzer, S.: Symbolische Auswertung und Heuristiken zur Verifikation funktionaler Programme. Doctoral dissertation, TU Darmstadt (2007)
14. Walther, C.: Mathematical induction. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 2, pp. 127-228. Oxford University Press, Oxford (1994)
15. Walther, C., Aderhold, M., Schlosser, A.: The L 1.0 Primer. Technical Report VFR 06/01, Technische Universität Darmstadt (2006)
16. Walther, C., Schweitzer, S.: About VeriFun. In: Baader, F. (ed.) Automated Deduction - CADE-19. LNCS (LNAI), vol. 2741, pp. 322-327. Springer, Heidelberg (2003)
17. Walther, C., Schweitzer, S.: Verification in the classroom. Journal of Automated Reasoning 32(1), 35-73 (2004)
18. Walther, C., Schweitzer, S.: Reasoning about incompletely defined programs. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 427-442. Springer, Heidelberg (2005)