Abstract
This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying programs, and for program development. They are simpler, more general, easier to write, and they make proofs easier.
Chapter PDF
References
Hehner. E.C.R.: a Practical Theory of Programming, Springer, New York, 1993; current edition available free at www.cs.utoronto.ca/ hehner/aPToP
Hehner, E.C.R., Gravell, A.M.: Refinement Semantics and Loop Rules. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, pp. 1497–1510. Springer, Heidelberg (1999), www.cs.utoronto.ca/~hehner/RSLR.pdf
Hehner, E.C.R.: Specifications, Programs, and Total Correctness. Science of Computer Programming, 34, 191–205. Elsevier, Amsterdam (1999), www.cs.utoronto.ca/~hehner/SPTC.pdf
Kassios, I.T.: A Theory of Object Oriented Refinement, Ph.D. thesis, University of Toronto (2006)
Lai, A.Y.C.: A Tool for a Formal Refinement Method, MSc thesis, University of Toronto (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hehner, E.C.R. (2008). Specified Blocks. In: Meyer, B., Woodcock, J. (eds) Verified Software: Theories, Tools, Experiments. VSTTE 2005. Lecture Notes in Computer Science, vol 4171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69149-5_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-69149-5_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69147-1
Online ISBN: 978-3-540-69149-5
eBook Packages: Computer ScienceComputer Science (R0)