An Analysis of Operation-Refinement in an Abortive Paradigm
Electronic Notes in Theoretical Computer Science (ENTCS)
A relational investigation of UTP designs and prescriptions
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
| Hi-index | 0.00 |
This paper investigates data-refinement by backwardsimulation for specifications whose semantics is given bypartial relations. The standard model-theoretic approach isbased on totalisation and lifting. The paper examines thismodel, exploring and isolating the precise roles played bylifting and totalisation in the standard account by introducinga simpler, normative theory of backward simulationdata-refinement (SB-refinement) which captures refinementdirectly in the language and in terms of the natural propertiesof preconditions and postconditions. This theory is usedin conjunction with four other model-theoretic approachesto determine the extent to which the standard approach iscanonical, and the extent to which it is arbitrary.