Reasoning about recursive procedures with parameters

Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2003

Volumn , Issue , 2003, Pages

  Back, Ralph Johan ^a   Preoteasa, Viorel ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Hoare logic; Predicate transformer semantics; Recursive procedures; Refinement Calculus

Indexed keywords

BINS; FORMAL LOGIC; SEMANTICS;

HOARE LOGIC; LOCAL VARIABLES; MECHANICAL VERIFICATION; PREDICATE TRANSFORMER SEMANTICS; PROGRAM VARIABLES; RECURSIVE PROCEDURE; REFINEMENT CALCULI; VARIABLE SUBSTITUTION;

CALCULATIONS;

EID: 84996571175     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/976571.976573     Document Type: Conference Paper

References (25)

1. R. J. Back and V. Preoteasa. Reasoning about recursive procedures with parameters. Technical Report 500, TUCS - Turku Centre for Computer Science, January 2003.
2. R. J. Back and J. Von Wright. Refinement Calculus. A systematic Introduction. Springer, 1998.
3. R. J. Back and J. Von Wright. Compositional action system refinement. In J. Derrick, E. Boiten, J. Woodcock, and J. von Wright, editors, Electronic Notes in Theoretical Computer Science, volume 70. Elsevier Science Publishers, 2002.
4. O. Celiku and J. Von Wright. Theorem prover support for precondition and correctness calculation. In 4th International Conference on Formal Engineering Methods, volume 2495 of Lecture Notes in Computer Science, pages 299-310. Springer-Verlag, October 2002.
5. A. Church. A formulation of the simple theory of types. J. Symbolic logic, 5:56-68, 1940.
6. B. A. Davey and H. A. Priestley. Introduction to lattices and order. Cambridge University Press, New York, second edition, 2002.
7. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Comm. ACM, 18(8):453-457, 1975.
8. E. W. Dijkstra. A discipline of programming. Prentice-Hall Inc., Englewood Cliffs, N. J., 1976. With a foreword by C. A. R. Hoare, Prentice-Hall Series in Automatic Computation.
9. J. E. Donahue. Complementary definitions of programming language semantics. Springer-Verlag, Berlin, 1976. Lecture Notes in Computer Science, Vol. 42.
10. M. J. C. Gordon. Mechanizing programming logics in higher-order logic. In Birtwistle, G. M. and Subrahmanyam, P. A., editors, Current Trends in Hardware Verification and Automatic Theorem Proving (Proceedings of the Workshop on Hardware Verification), pages 387-439, Banff, Canada, 1988. Springer-Verlag, Berlin.
11. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL. Cambridge University Press, Cambridge, 1993. A theorem proving environment for higher order logic, Appendix B by R. J. Boulton.
12. W. M. Hesselink. Predicate transformers for recursive procedures with local variables. Formal Aspect of Computing, 11:616-336, 1999.
13. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969.
14. T. Kleymann. Hoare Logic and VDM: Machine-Checked Soundness and Completeness Proofs. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1998.
15. T. Kleymann. Hoare logic and auxiliary variables. Formal Aspect of Computing, 11:541-566, 1999.
16. L. Laibinis. Mechanised Formal Reasoning About Modular Programs. PhD dissertation, Turku Centre for Computer Science, April 2000.
17. C. Morgan. Procedures, parameters, and abstraction: separate concerns. Sci. Comput. Programming, 11(1):17-27, 1988.
18. S. Owre, N. Shankar, J. M. Rushby, and D. W. J. Stringer-Clavert. PVS Language Reference, 1999.
19. J. C. Reynolds. The Craft of Programming. Prentice-Hall Inc., London, 1981.
20. J. C. Reynolds. The essence of ALGOL. In Algorithmic languages (Amsterdam, 1981), pages 345-372. North-Holland, Amsterdam, 1981.
21. M. Staples. A Mechanised Theory of Refinement. PhD dissertation, Computer Laboratory, University of Cambridge November 1998.
22. M. Staples. Representing WP semantics in Isabelle/ZF. In Theorem proving in higher order logics (Nice, 1999), volume 1690 of Lecture Notes in Comput. Sci., pages 239-254. Springer, Berlin, 1999.
23. M. Staples. Interfaces for refining recursion and procedures. Formal Aspect of Computing, 12:372-391, 2000.
24. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math., 5:285-309, 1955.
25. D. Von Oheimb. Hoare logic for mutual recursion and local variables. In C. Pandu Rangan, V. Raman, and R. Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1738 of LNCS, pages 168-180. Springer, 1999.