Abstract
This paper presents a behavioural semantics for abstract data types, and thus a correspondence between data types and processes. The value of this correspondence lies in the fact that simulation of the abstract data types is easily verified, and is equivalent to failures refinement of the corresponding processes.
The method of constructing a semantics, and the method of proving equivalence between notions of refinement, are independent of the chosen interpretation. The same methods can be used to establish other correspondences between state-based and behavioural descriptions.
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.
Similar content being viewed by others
References
R. J. R. Back and K. Sere. Stepwise refinement of action systems. In Proceedings of the International Conference on Mathematics of Program Construction, volume 375 of LNCS, pages 115–138. Springer, 1989.
M. J. Butler. Refinement and decomposition of value-passing action systems. In E. Best, editor, Concurrency Theory (CONCUR ’93), volume 715 of LNCS. Springer-Verlag, 1993.
R. Duke, G. Rose, and G. Smith. Object Z: a specification language advocated for the description of standards. Computer Standards and Interfaces, 17:511–533, 1995.
C. Fischer. Combining CSP and Z. Technical report, University of Oldenburg, 1997.
C. Fischer. CSP-OZ: A combination of Object-Z and CSP. In H. Bowman and J. Derrick, editors, Formal Methods for Open Object-Based Distributed Systems (FMOODS ’97) volume 2, pages 423–438. Chapman and Hall, 1997.
C. Fischer. How to combine Z with a process algebra. In J. Bowen, A. Fett, and M. Hinchey, editors, Z Users’ meeting (ZUM ’98), volume 1493 of LNCS, pages 5 - 23. Springer-Verlag, 1998.
C. Fischer and G. Smith. Combining CSP and Object-Z: Finite or infinite trace semantics? In T. Higashino N. Shiratori and A. Togashi, editors, Proceedings of FORTE/PSTV’97, pages 503–518. Chapman and Hall, 1997.
C. A. R. Hoare, J. He, and J. W. Sanders. Prespecification in data refinement. Information Processing Letters, 25(2):71–76, 1987.
C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1997.
A. W. Roscoe, J. C. P. Woodcock, and L. Wulf. Non-interference through determinism. In D. Gollman, editor, ESORICS ’94, volume 875 of LNCS, pages 33–54. Springer-Verlag, 1994.
G. Smith and J. Derrick. Refinement and verification of concurrent systems specified in Object-Z and CSP. In First International Conference on Formal Engineering Methods (ICFEM’97), pages 293–302. IEEE Computer Press, 1997.
G. Smith. A semantic integration of Object-Z and CSP for the specification of concurrent systems. In J. Fitzgerald, C. B. Jones, and P. Lucas, editors, Formal Methods Europe (FME ’97), volume 1313 of LNCS, pages 62–81. Springer-Verlag, 1997.
J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall, 2nd edition, 1992.
J. C. P. Woodcock and J. Davies. Using Z: Specification, Proof and Refinement. Prentice Hall International Series in Computer Science, 1996.
J. C. P. Woodcock and C. C. Morgan. Refinement of state-based concurrent systems. In VDM Symposium 1990, volume 428 of LNCS, pages 340–351. Springer-Verlag, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London Limited
About this paper
Cite this paper
Bolton, C., Davies, J., Woodcock, J. (1999). On the Refinement and Simulation of Data Types and Processes. In: Araki, K., Galloway, A., Taguchi, K. (eds) IFM’99. Springer, London. https://doi.org/10.1007/978-1-4471-0851-1_15
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0851-1_15
Publisher Name: Springer, London
Print ISBN: 978-1-85233-107-8
Online ISBN: 978-1-4471-0851-1
eBook Packages: Springer Book Archive