Abstract
The drawbacks of using refinement alone in the construction of specifications from simple abstract models is used as the spur for the introduction of retrenchment — a method based on the main ideas of refinement but one which is more liberal in character. The basics of the retrenchment mechanism are reviewed in preparation for exploring its integration with refinement. The particular aspect of integration investigated in this paper is the factorisation of a retrenchment step from an abstract to a concrete model into a refinement followed by a retrenchment. The objective is to engineer a system which is at the level of abstraction of the concrete model, but is refinable from the abstract one. The construction given here solves the problem in a universal manner, there being a canonical factorisation of the original retrenchment into an I/O-filtered refinement to the universal system followed by a retrenchment. The universal property arises from the fact that the refinement component of any similar factorisation is refinable to the universal system. An idempotence property supports the claim that the construction is at the correct level of abstraction. A synopsis of an earlier result which factorised a retrenchment step into a canonical retrenchment to a universal system followed by a refinement is presented. A refinement relationship is then shown to exist between the two universal systems. Finally, the consequences of including termination criteria are briefly explored.
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.
References
Abrial J. R. The B-Book: Assigning Programs to Meanings. C.U.P., 1996.
Back R. J. R., von Wright J. Refinement Calculus: A Systematic Introduction. Springer, 1998.
Banach R. Maximally Abstract Retrenchments. In Proc. IEEE ICFEM-00, pages 133–142. Computer Society Press, 2000.
Banach R., Poppleton M. Retrenchment: An Engineering Variation on Refinement. In Bert (ed.), Proc. B-98, LNCS 1393, 129–147. Springer 1998. See also UMCS Technical Report UMCS-99-3-2, http://www.cs.man.ac.uk/cstechrep
Banach R., Poppleton M. Retrenchment and Punctured Simulation. In Araki, Galloway, Taguchi (eds.), Proc. IFM-99, pages 457–476. Springer 1999.
Banach R., Poppleton M. Sharp Retrenchment, Modulated Refinement and Simulation. Formal Aspects of Computing, 11, 498–540, 1999.
Banach R., Poppleton M. Retrenchment, Refinement and Simulation. In Bowen, Dunne, Galloway, King (eds.), Proc. ZB-00, LNCS 1878, 304–323. Springer, 2000.
Banach R., Poppleton M. Engineering and Theoretical Underpinnings of Retrenchment. To be submitted. Available at: http://www.cs.man.ac.uk/~banach/some.pubs/Retrench.Underpin.ps.gz
Boiten E., Derrick J. IO-Refinement in Z. In Third BCS-FACS Northern Formal Methods Workshop. Ilkley, U.K. 1998.
de Roever W.-P., Engelhardt K. Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge University Press, 1998.
Jones C. B. Systematic Software Development Using VDM, 2nd ed. Prentice Hall, 1990.
Litteck H.J., Wallis P.J.L. Refinement Methods and Refinement Calculi. Software Engineering Journal 7(3), 219–229, 1992.
Liu S. Evolution: A More Practical Approach than Refinement for Software Development. In Proc. ICECCS-97, pages 142–151. IEEE, 1997.
Morgan C. Programming from Specifications, 2nd ed. Prentice Hall, 1994.
Poppleton M., Banach R. Retrenchment: Extending Refinement for Continuous and Control Systems. In Proc. IWFM’00, Springer Electronic Workshop in Computer Science Series, http://ewic.org.uk/ewic. Springer, 2000.
Smith G. Stepwise Development from Ideal Specifications. In Edwards (ed.), Aus. Sci. Conf. 22(1), 227–233. IEEE Computer Society, 2000.
Smith G., Fidge C. Incremental Development of Real-Time Requirements: The Light Control Case Study. JUCS 6, 704–730, 2000.
Spivey J. M. The Z Notation: A Reference Manual, 2nd ed. Prentice Hall, 1993.
Stepney S., Cooper D., Woodcock J. More Powerful Z Data Refinement: Pushing the State of the Art in Industrial Refinement. In Bowen, Fett, Hinchey (eds.), Proc. ZUM’98, LNCS 1493, 284–307. Springer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeske, C., Banach, R. (2002). Minimally and Maximally Abstract Retrenchments. In: Butler, M., Petre, L., Sere, K. (eds) Integrated Formal Methods. IFM 2002. Lecture Notes in Computer Science, vol 2335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47884-1_21
Download citation
DOI: https://doi.org/10.1007/3-540-47884-1_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43703-1
Online ISBN: 978-3-540-47884-3
eBook Packages: Springer Book Archive