Abstract
In our preceding treatment of iteration, we have considered the situation where the body of the iteration is either monotonic or continuous. In this chapter, we look at some of the additional properties that iterative statements have when the bodies are conjunctive. We show how weak and strong iteration are related in this case. We also prove two important properties that hold for iterations of conjunctive predicate transformers: the decomposition property, which shows how iteration of a meet can be rewritten in terms of iteration and sequential composition only, and the leapfrog property. The chapter also gives examples of program transformations that are used to modify the control structure of program statements.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Back, RJ., von Wright, J. (1998). Iteration of Conjunctive Statements. In: Refinement Calculus. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1674-2_29
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1674-2_29
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98417-9
Online ISBN: 978-1-4612-1674-2
eBook Packages: Springer Book Archive