© University of Kent - Contact | Feedback | Legal | FOI | Cookies
A single complete refinement rule for Z
J. Derrick
Logic and Computation, 10(5):182-196, October 2000.Abstract
Data refinement is a well established technique for transforming specifications of abstract data types into ones which are closer to an eventual implementation. The conditions under which a transformation is a correct refinement can be encapsulated into two simulation rules: downward and upward simulations. These simulations are known to be sound and jointly complete for boundedly-nondeterministic specifications. In this note we derive a single complete refinement method and show how it may be formulated in Z, this is achieved by using possibility mappings. The use of possibility mappings themselves is not new, our aim here is to reformulate them for use within the Z specification language.
Download publication 159 kbytes (PostScript)Bibtex Record
@article{1124,
author = {J. Derrick},
title = {A single complete refinement rule for {Z}},
month = {October},
year = {2000},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2000/1124},
journal = {Logic and Computation},
number = {5},
publication_type = {article},
publisher = {Oxford University Press},
submission_id = {20478_971441260},
volume = {10},
}