Abstract
Refinement semantics is an alternative to least fixpoint semantics that is more useful for programming. From it we derive a variety of rules for while-loops, for-loops, and loops with intermediate and deep exits. We illustrate the use of these rules with examples.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E.W. Dijkstra: a Discipline of Programming, Prentice-Hall, New Jersey, 1976
E.W. Dijkstra, A.J.M.van Gasteren: “a Simple Fixpoint Argument without the Restriction to Continuity”, Acta Informatica v.13 p.1–7, 1986
A.M. Gravell: “Simpler Laws for the Introduction of Loops”, ECS, University of Southampton, 1996
E.C.R. Hehner: a Practical Theory of Programming, Springer-Verlag, New York, 1993
C.A.R. Hoare: “an Axiomatic Basis for Computer Programming”, CACM 12(10), 1969
C.A.R. Hoare: “a Note on the for statement”, BIT v.12 n.3 p.334–341, 1972
C.A.R. Hoare, J. He: “the Weakest Prespecification”, Fundamenta Informaticae v.9 p.51–84, 217-252, 1986
C.C. Morgan: Programming from Specifications, second edition, Prentice-Hall, London, 1994
T.S. Norvell: “Predicative Semantics of Loops”, Algorithmic Languages and Calculi, Chapman-Hall, 1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hehner, E.C.R., Gravel, A.M. (1999). Refinement semantics and loop rules. In: Wing, J.M., Woodcock, J., Davies, J. (eds) FM’99 — Formal Methods. FM 1999. Lecture Notes in Computer Science, vol 1709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48118-4_29
Download citation
DOI: https://doi.org/10.1007/3-540-48118-4_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66588-5
Online ISBN: 978-3-540-48118-8
eBook Packages: Springer Book Archive