Abstract
The refinement calculus, based on weakest preconditions, elaborates program developments as a series of steps linked by a mathematical refinement relation. Specifications and executable code are regarded equally as programs, allowing a gradual transformation from one to the other.
Procedures, parameters, recursion, typing and miracles are accommodated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.-J.R. Back. A calculus of refinements for program derivations. Acta Informatica, 25: 593–624, 1988.
E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, 1976.
C.C. Morgan. Programming from Specifications. Prentice-Hall, 1990.
C.O Morgan and T.N. Vickers, editors. On the Refinement Calculus. FACIT Series in Computer Science. Springer, 1993.
J.M. Morris. A theoretical basis for stepwise refinement and the programming calculus. Science of Computer Programming, 9 (3): 287–306, December 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morgan, C. (1993). The Refinement Calculus. In: Broy, M. (eds) Program Design Calculi. NATO ASI Series, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02880-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-02880-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08164-4
Online ISBN: 978-3-662-02880-3
eBook Packages: Springer Book Archive