Abstract
A classification of different kinds of VDM refinements is given. Based on this classification a more appealing explanation of an example from the VDM literature can be given.
The work on this paper has been supported by The Danish Technical Research Council (STVF).
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
C.A.R. Hoare. Proof of correctness of data representations. Acta Informatica 1, pp. 271–281. 1972.
C.B. Jones. VDM Proof Obligations and their Justification. VDM’87, LNCS 252, pp. 260–286. 1987.
C.B. Jones. Systematic Software Development Using VDM. 2nd ed. Prentice Hall International. 1990.
C.B. Jones, R.C.F. Shaw (eds). Case studies in systematic software development. Prentice Hall International. 1990.
T. Nipkow. Non-Deterministic Data Types: Models and Implementations. Acta Informatica, 22, pp. 629–661, 1986.
O. Schoett. Behavioural correctness of data representations. Department of Computer Science. University of Edinburgh. CSR-185–85. April 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Elvang-Gøransson, M. (1992). Classification of Refinements in VDM. In: Jones, C.B., Shaw, R.C., Denvir, T. (eds) 5th Refinement Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3550-0_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3550-0_9
Publisher Name: Springer, London
Print ISBN: 978-3-540-19752-2
Online ISBN: 978-1-4471-3550-0
eBook Packages: Springer Book Archive