Derrick, John and Boiten, Eerke
Calculating upward and downward simulations of state-based specifications.
Information and Software Technology, 41
(Full text available)
This paper concerns calculational methods of refinement in state-based specification languages. 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 are encapsulated into two simulation rules: downward and upward simulations. One approach for refining an abstract system is to specify the concrete data type, and then attempt to verify that it is a valid refinement of the abstract type. An alternative approach is to calculate the concrete specification based upon the abstract specification and a retrieve relation, which links the abstract and concrete states. In this paper we generalise existing calculational methods for downward simulations and derive similar results for upward simulations; we also document their use and application in a particular specification language, namely Z.
||refinement; state-based systems; Z; calculating refinements
||Faculties > Science Technology and Medical Studies > School of Computing
||14 Jun 2009 19:25
||12 May 2014 12:55
||https://kar.kent.ac.uk/id/eprint/17282 (The current URI for this page, for reference purposes)
- Depositors only (login required):