Abstract
In the refinements we have looked at so far the abstract and concrete data types have been conformal, i.e., there has been a 1-1 correspondence between the abstract and concrete operations. Thus given an abstract program, we know exactly the concrete program that will simulate it.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Weak Refinement. 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_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0257-1_11
Publisher Name: Springer, London
Print ISBN: 978-1-85233-245-7
Online ISBN: 978-1-4471-0257-1
eBook Packages: Springer Book Archive