Abstract
Assume we want to develop a program S to satisfy {Q} S {R} for given Q and R, and that we have decided to use a loop (possibly with some initialization). How do we find a suitable invariant and bound function for the loop —before writing the loop? This chapter explores this question.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Gries, D. (1981). Developing Invariants. In: The Science of Programming. Text and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5983-1_17
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5983-1_17
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96480-5
Online ISBN: 978-1-4612-5983-1
eBook Packages: Springer Book Archive