Calculational reasoning revisited: An isabelle/isar experience

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

Volumn 2152, Issue , 2001, Pages 75-90

  Bauer, Gertrud ^a   Wenzel, Markus ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGIC;

COMPUTATIONAL TREE LOGIC; HIGHER-ORDER UNIFICATION; HUMAN-READABLE; ISABELLE; LOGICAL FRAMEWORKS; NATURAL DEDUCTION PROOFS; NON-INTRUSIVE; SETTING OUTS;

THEOREM PROVING;

EID: 35048832643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44755-5_7     Document Type: Conference Paper

References (23)

1. R.J. Back, J. Grundy, and J. von Wright. Structured calculational proof. Formal Aspects of Computing, 9, 1997.
2. R.J. Back and J. von Wright. Structured derivations: A method for doing highschool mathematics carefully. Technical report, Turku Centre for C.S., 1999.
3. G. Bauer and M. Wenzel. Computer-assisted mathematics at work — the Hahn- Banach theorem in Isabelle/Isar. In T. Coquand, P. Dybjer, B. Nordström, and J. Smith, editors, Types for Proofs and Programs: TYPES’99, LNCS, 2000.
4. Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Thery, editors. Theorem Proving in Higher Order Logics: TPHOLs ’99, LNCS 1690, 1999.
5. E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Texts and monographs in computer science. Springer, 1990.
6. G. Gentzen. Untersuchungen über das logische Schließen. Mathematische Zeitschrift, 1935.
7. J. Grundy. Window inference in the HOL system. In M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley, editors, Proceedings of the International Workshop on HOL. ACM SIGDA, IEEE Computer Society Press, 1991.
8. J. Harrison. A Mizar mode for HOL. In J. Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: TPHOLs ’96, LNCS 1125, 1997.
9. K. McMillan. Lecture notes on verification of digital and hybrid systems. NATO summer school, http://www-cad.eecs.berkeley.edu/~kenmcmil/tutorial/toc.html.
10. K. McMillan. Symbolic Model Checking: an approach to the state explosion problem. PhD thesis, Carnegie Mellon University, 1992.
11. Mizar mathematical library. http://www.mizar.org/library/.
12. M. Muzalewski. An Outline of PC Mizar. Fondation of Logic, Mathematics and Informatics — Mizar Users Group, 1993.
13. L.C. Paulson. Isabelle: A Generic Theorem Prover. LNCS 828. 1994.
14. M. Simons. Proof presentation for Isabelle. In E. L. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics: TPHOLs ’97, LNCS 1275, 1997.
15. D. Syme. DECLARE: A prototype declarative proof system for higher order logic. Technical Report 416, University of Cambridge Computer Laboratory, 1997.
16. D. Syme. Three tactic theorem proving. In Bertot et al. [4].
17. A. Trybulec. Some features of the Mizar language. Presented at a workshop in Turin, Italy, 1993.
18. R. Verhoeven and R. Backhouse. Interfacing program construction and verification. In J. Wing and J. Woodcock, editors, FM99: The World Congress in Formal Methods, volume 1708 and 1709 of LNCS, 1999.
19. M. Wenzel. Isar — a generic interpretative approach to readable formal proof documents. In Bertot et al. [4].
20. M. Wenzel. The Isabelle/Isar Reference Manual, 2000. Part of the Isabelle distribution, http://isabelle.in.tum.de/doc/isar-ref.pdf.
21. M. Wenzel. Some aspects of Unix file-system security. Isabelle/Isar proof document, http://isabelle.in.tum.de/library/HOL/Unix/document.pdf, 2001.
22. F. Wiedijk. Mizar: An impression. Unpublished paper, 1999. http://www.cs.kun.nl/~freek/mizar/mizarintro.ps.gz.
23. V. Zammit. On the implementation of an extensible declarative proof language. In Bertot et al. [4].