Abstract
In the introductory Section 4.1 we informally define partial correctness assertions and notions relating to weakest preconditions with the Pascal fragment of Section 1.2 in mind. Here, we state a number of well-known properties and proof rules whose truth is intuitively evident.
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.
Notes and References for Chapter 4
E. W. Dijkstra, A Discipline of Programming, Prentice-Hall, 1976.
D. Gries, The Science of Programming, Spring-Verlag, 1983.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Manes, E.G., Arbib, M.A. (1986). Assertion Semantics. In: Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4962-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4962-7_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9377-4
Online ISBN: 978-1-4612-4962-7
eBook Packages: Springer Book Archive