Henson, M and Deutsch, M and Reeves, S (2002) CSM-363 - Six theories of operation refinement for partial relation semantics. UNSPECIFIED. CSM-363, University of Essex, Colchester.
Henson, M and Deutsch, M and Reeves, S (2002) CSM-363 - Six theories of operation refinement for partial relation semantics. UNSPECIFIED. CSM-363, University of Essex, Colchester.
Henson, M and Deutsch, M and Reeves, S (2002) CSM-363 - Six theories of operation refinement for partial relation semantics. UNSPECIFIED. CSM-363, University of Essex, Colchester.
Abstract
In this paper we analyse total correctness operation refinement on a partial relation semantics for specification. In particular we show that three theories: a relational completion approach, a proof-theoretic approach and a functional models approach, are all equivalent. This result holds whether or not preconditions are taken to be minimal or fixed conditions for establishing the postcondition.
| Item Type: | Monograph (UNSPECIFIED) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 27 Feb 2014 11:51 |
| Last Modified: | 16 May 2024 17:58 |
| URI: | http://repository.essex.ac.uk/id/eprint/8670 |
Available files
Filename: csm-363.pdf