© University of Kent - Contact | Feedback | Legal
The University of Kent, Canterbury, Kent, CT2 7NZ, T +44 (0)1227 764000
Refinement in a state-based language such as Z, on the other hand, is defined using a relational model in terms of input/output behaviour of abstract programs. These refinements are verified by using two simulation rules which help make the verification tractable.
The purpose of this paper is to unify these two standpoints, and we do so by generalising the standard relational model to include additional observable aspects. The central result of the paper is then to develop simulation rules to verify relations such as failures-divergences refinement in a relational setting, and show how these might be applied in a specification language such as Z.
@inproceedings{1564,
author = {Eerke Boiten and John Derrick},
title = {Unifying concurrent and relational refinement},
month = {July},
year = {2002},
pages = {38},
keywords = {refinement, Z, CSP, Object-Z, failures-divergences},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2002/1564},
publication_type = {inproceedings},
submission_id = {27976_1038826463},
booktitle = {REFINE 02: The BCS FACS Refinement Workshop},
editor = {John Derrick and Eerke Boiten and Jim Woodcock and Joakim von Wright},
volume = {70(3)},
series = {Electronic Notes in Theoretical Computer Science},
publisher = {Elsevier Science Publishers},
}