Abstract
The previous chapter presented the underlying theory of data refinement for ADTs — its definition for total relations, its verification using upward and downward simulations and, finally, how simulation rules for partial operations are derived from these. All of the questions listed at the beginning of Chapter 3 have now been answered, with the exception of the one concerning input and output.
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
© 2001 Springer-Verlag London
About this chapter
Cite this chapter
Derrick, J., Boiten, E. (2001). Refinement in Z. In: Refinement in Z and Object-Z. Formal Approaches to Computing and Information Technology. Springer, London. https://doi.org/10.1007/978-1-4471-0257-1_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0257-1_4
Publisher Name: Springer, London
Print ISBN: 978-1-85233-245-7
Online ISBN: 978-1-4471-0257-1
eBook Packages: Springer Book Archive