Abstract
This chapter discusses two methods for developing a loop when the precondition Q, the postcondition R, the invariant P and the bound function t are given. The first method leads naturally to a loop with a single guarded command, do B → S od. The second takes advantage of the flexibility of the iterative construct and generally results in loops with more than one guarded command.
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 Loops from Invariants and Bounds. 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_16
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5983-1_16
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