An algebraic treatment of procedure refinement to support mechanical verification

Formal Aspects of Computing

Volumn 17, Issue 1, 2005, Pages 69-90

  Back, Ralph Johan ^a   Preoteasa, Viorel ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

Hoare logic; Mechanical verification; Recursive procedures; Refinement; Semantics

Indexed keywords

ALGEBRA; FORMAL LOGIC; RECURSIVE FUNCTIONS; SEMANTICS; SPECIFICATIONS; THEOREM PROVING;

HOARE LOGIC; MECHANICAL VERIFICATION; RECURSIVE PROCEDURE; REFINEMENT;

COMPUTER SOFTWARE;

EID: 18744403037     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-004-0060-7     Document Type: Article

References (33)

1. [Bac78] Back RJ (1978) On the correctness of refinement in program development. PhD Thesis. Department of Computer Science. University of Helsinki
2. [Bac80] Back RJ (1980) Correctness preserving program refinements: proof theory and applications, volume 131 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam
3. [BMW89] Bijlsma A, Matthews PA, Wiltink JG (1989) A sharp proof rule for procedures in wp semantics. Acta Inf 26(5):409-419
4. [BvW98] Back RJ, von Wright J (1998) Refinement Calculus. A systematic introduction. Springer, Berlin Heidelberg New York
5. [BvW03] Back RJ, von Wright J (2003) Compositional action system refinement. Formal Aspects Comput 15(2-3):103-117
6. [Chu40] Church A (1940) A formulation of the simple theory of types. J Symbolic logic 5:56-68
7. [CvW02] Celiku O, von Wright J (2002) Theorem prover support for precondition and correctness calculation. In: 4th international conference on formal engineering methods. volume 2495 of Lecture Notes in Computer Science. Springer. Berlin Heidelberg New York, pp 299-310
8. [Dij75] Dijkstra EW (1975) Guarded commands, nondeterminacy and formal derivation of programs. Comm ACM 18(8):453-457
9. [Dij76] Dijkstra EW (1976) A discipline of programming. Prentice-Hall, Englewood Cliffs. With a foreword by C. A. R. Hoare, Prentice-Hall Series in Automatic Computation
10. [Don76] Donahue JE (1976) Complementary definitions of programming language semantics. Lecture Notes in Computer Science, vol 42. Springer, Berlin Heidelberg New York
11. [GL80] Gries D. Levin G (1980) Assignment and procedure call proof rules. ACM Trans Programming Languages Syst (TOPLAS) 2(4):564-579
12. [Gor88] Gordon MJC (1988) Mechanizing programming logics in higher-order logic. In: Birtwistle GM, Subrahmanyam PA (eds) Current trends in hardware verification and automatic theorem proving (Proceedings of the workshop on hardware verification), Banff, Springer, Berlin Heidelberg New York, pp 387-439
13. [Hes99] Hesselink WM (1999) Predicate transformers for recursive procedures with local variables. Formal Aspect Comput 11:616-336
14. [Hoa69] Hoare CAR (1969) An axiomatic basis for computer programming. Commun ACM 12(10):576-580
15. [Kle98] Kleymann T (1998) Hoare logic and VDM: machine-checked soundness and completeness proofs. PhD Thesis. Laboratory for Foundations of Computer Science, University of Edinburgh
16. [Kle99] Kleymann T (1999) Hoare logic and auxiliary variables. Formal Aspect Comput 11:541-566
17. [Lai00] Laibinis L (2000) Mechanised formal reasoning about modular programs. PhD dissertation. Turku Centre for Computer Science
18. [LvW01] Laibinis L. von Wright J (2001) Specification variables: Between the angel and the demon. Technical Report 412. TUCS - Turku Centre for Computer Science
19. [Mor87] Morris JM (1987) A theoretical basis for stepwise refinement and the programming calculus. Sci Comput Programming 9(3):287-306
20. [Mor88a] Morgan C (1988) Procedures, parameters, and abstraction: separate concerns. Sci Comput Programming 11(1):17-27
21. [Mor88b] Morgan C (1988) The specification statement. ACM Trans Program Lang Syst 10(3):403-419
22. [Mor90a] Morgan C (1990) Programming from specifications. Prentice-Hall, Englewood Cliffs
23. [Mor90b] Morris JM (1990) Programs from specifications. In: Formal development programs and proofs. Addison-Wesley/Longman, Reading/London, pp 81-115
24. [Nau01] Naumann DA (2001) Calculating sharp adaptation rules. Inf Process Lett 77(2-4):201-208
25. [Old83] Olderog ER (1983) On the notion of expressiveness and the rule of adaptation. Theoret Comput Sci 24(3):337-347
26. [OSRSC01] Owre S. Shankar N. Rushby JM. Stringer-Clavert DWJ (2001) PVS language reference. Technical report, Computer Science Laboratory, SRI International
27. [Rey81a] Reynolds JC (1981) The craft of programming, Prentice-Hall, London
28. [Rey81b] Reynolds JC (1981) The essence of ALGOL, In: Algorithmic languages (Amsterdam, 1981). North-Holland, Amsterdam, pp 345-372
29. [Sta98] Staples M (1998) A mechanised theory of refinement. PhD dissertation. Computer Laboratory. University of Cambridge
30. [Sta99] Staples M (1999) Representing WP semantics in Isabelle/ZF. In: Theorem proving in higher order logics (Nice. 1999), volume 1690 of Lecture Notes in Computer Science Springer, Berlin Heidelberg New York, pp 239-254
31. [Sta00] Staples M (2000) Interfaces for refining recursion and procedures. Formal Aspect Comput 12:372-391
32. [Tar55] Tarski A (1955) A lattice-theoretical fixpoint theorem and its applications. Pacific J Math 5:285-309
33. [vO99] von Oheimb D (1999) Hoare logic for mutual recursion and local variables. In: Pandu Rangan C, Raman V. Ramanujam R (eds) Foundations of software technology and theoretical computer science, vol 1738 of LNCS. Springer, Berlin Heidelberg New York, pp 168-180