Theorem prover support for precondition and correctness calculation

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

Volumn 2495, Issue , 2002, Pages 299-310

  Celiku, Orieta ^a   Von Wright, Joakim ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING; THEOREM PROVING;

ANGELIC NONDETERMINISM; CORRECTNESS THEOREM; MODEL INTERACTION; PROGRAM CORRECTNESS; PROGRAM VARIABLES; THEOREM PROVERS; VERIFICATION CONDITION; WEAKEST PRECONDITION;

FORMAL METHODS;

EID: 23044534014     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-36103-0_32     Document Type: Article

References (17)

1. R. J. Back and J. von Wright. Refinement Calculus: A Systematic Introduction. Springer-Verlag, 1998.
2. S. Bensalem, Y. Lakhnech, S. Saidi. Powerful Techniques for the Automatic Generation of Invariants. In Computer Aided Verification, CAV ’96, LNCS 1102, 1996.
3. M. J. Butler, J. Grundy, T. Långbacka, R. Rukšenas, and J. von Wright. The Refinement Calculator: Proof Support for Program Refinement. In Proc. FMP’97 - Formal Methods Pacific, Discrete Mathematics and Theoretical Computer Science, Wellington, New Zealand, July 1997. Springer-Verlag.
4. L. A. Dennis, G. Collins, M. Norrish, R. Boulton, K. Slind, G. Robinson, M. Gordon, and T. Melham, The PROSPER Toolkit. In Proc. of TACAS 2000, LNCS 1785, Springer-Verlag.
5. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall International, 1976.
6. J. C. Filliâtre. Proof of imperative programs in Type Theory. In International Workshop, TYPES’98, Kloster Irsee, Germany. LNCS 1657, Springer-Verlag, 1998.
7. M. Gordon. Mechanizing Programming Logics in Higher Order Logic. In G. Birtwistel and P. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving. Springer-Verlag, 1989.
8. M. J. C. Gordon and T. F. Melham. Introduction to HOL. Cambridge University Press, New York, 1993.
9. N. Heintze, J. Jaffar, and R. Voicu. A Framework for Combining Analysis and Verification. In Proc. of POPL 2000, pp 26-39, 2000.
10. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-583, 1969.
11. P. V. Homeier. Trustworthy Tools for Trustworthy Programs: A Mechanically Verified Verification Condition Generator for the Total Correctness of Procedures. Ph.D. Dissertation, UCLA Computer Science Department, 1995.
12. C. B. Jones. Systematic Software Development Using VDM. Prentice-Hall International, 1986.
13. T. Kleymann. Hoare Logic and VDM: Machine-Checked Soundness and Completeness Proofs. Ph.D. Thesis, University of Edinburgh, ECS-LFCS-98-392, FCS, 1998.
14. L. Laibinis. Mechanized Formal Reasoning about Modular Programs. Ph.D. Thesis, Turku Centre for Computer Science Dissertations, 24, Finland, April, 2000.
15. L. Laibinis and J. von Wright. What’s in a Specification. In Proc. International Refinement Workshop and Formal Methods Pacific 1998, Discrete Mathematics and Theoretical Computer Science, Canberra, Australia, 1998. Springer-Verlag.
16. T. Nipkow. Winskel is (almost) Right: Towards a Mechanized Semantics Textbook. Formal Aspects of Computing, 10(2):171-186, 1998.
17. D. von Oheimb. Hoare Logic for Mutual Recursion and Local Variables. In Foundations of Software Technology and Theoretical Computer Science (FST and TCS), Springer LNCS, 1999.