Verification in the classroom

Journal of Automated Reasoning

Volumn 32, Issue 1, 2004, Pages 35-73

  Walther, Christoph ^a   Schweitzer, Stephan ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Computer uses in education; Computer aided verification; Deduction and automated theorem proving

Indexed keywords

COMPUTER USES IN EDUCATION; COMPUTER-AIDED VERIFICATION; DEDUCTION AND AUTOMATED THEOREM PROVING;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; SEMANTICS; STUDENTS; THEOREM PROVING; UTILITY PROGRAMS;

EDUCATION COMPUTING;

EID: 3543077166     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JARS.0000021872.64036.41     Document Type: Article

References (19)

1. http://www.informatik.tu-darmstadt.de/pm/verifun/.
2. http://www.cs.utexas.edu/users/boyer/ftp/nqthm/index.html.
3. Auer, J. and Aderhold, M.: Unentscheidbarkeit des Halteproblems - Ein computergestützter Beweis mit VeriFun, 2002.
4. Boyer, R. S. and Moore, J S.: A Computational Logic, Academic Press, New York, 1979.
5. Boyer, R. S. and Moore, J S.: A mechanical proof of the unsolvability of the halting problem, J. ACM 31(3) (1984), 441-458.
6. Boyer, R. S. and Moore, J S.: Proof checking the RSA public key encryption algorithm, Amer. Math. Monthly 91(3) (1984), 181-189.
7. Burstall, R. M.; Proving properties of programs by structural induction, Comput. J. 12(1) (1969), 41-48.
8. Gordon, M. J. C. and Melham, T. F.: Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic, Cambridge University Press, Cambridge, 1993.
9. Gosling, J., Joy, B. and Steele, G. L.: The Java Language Specification, Addison-Wesley, Reading, MA, 1996.
10. Hutter, D., Langenstein, B., Sengler, C., Siekmann, J., Stephan, W. and Wolpers, A.: Deduction in the verification support environment, in M.-C. Gaudel and J. Woodcock (eds.), Intern. Symp. of Formal Methods Europe (FME), Lecture Notes in Artif. Intell. 1051, Springer, New York, 1996.
11. Kaufmann, M. and Moore, J S.: ACL2: An industrial strength version of NQTHM, in Compass '96: 11th Annual Conf. on Computer Assurance, Gaithersburg, Maryland, 1996.
12. Owre, S., Rushby, J. and Shankar, N.: PVS: A prototype verification system, in Proc. 11th Intern. Conf. on Automated Deduction (CADE-92), Lecture Notes in Artif. Intell. 607, Springer-Verlag, New York, 1992.
13. Paulson, L. C.: Isabelle: A Generic Theorem Prover, Lecture Notes in Comput. Sci. 828, Springer-Verlag, New York, 1994.
14. Reif, W.: The KIV approach to software verification, in M. Broy and S. Jähnichen (eds.), KORSO: Methods, Languages and Tools for the Construction of Correct Software, Lecture Notes in Comput. Sci. 1009, Springer-Verlag, New York, 1995.
15. Walther, C.: Computing induction axioms, in A. Voronkov (ed.), Proc. of the Inter. Conf. on Logic Programming and Automated Reasoning (LPAR-1992) (St. Petersburg, Russia), Lecture Notes in Comput. Sci. 624, Springer-Verlag, New York, 1992, pp. 381-392.
16. Walther, C.: On proving the termination of algorithms by machine, Artificial Intelligence 71(1) (1994), 101-157.
17. Walther, C. and Schweitzer, S.: The VeriFun tutorial, Technical Report VFR 02/04, Program-miermethodik, Technische Universität Darmstadt, 2002.
18. Walther, C. and Schweitzer, S.: VeriFun user guide, Technical Report VFR, 02/01, Program-miermethodik, Technische Universität Darmstadt, 2002.
19. Walther, C. and Schweitzer, S.: About VeriFun, in F. Baader (ed.), Proc. of the 19th Inter. Conf. on Automated Deduction (CADE-19), Lecture Notes in Artif. Intell. 2741, Springer-Verlag, New York, 2003, pp. 322-327.