Henson, M and Deutsch, M and Reeves, S (2002) CSM-364 - An analysis of operation refinement in Z. UNSPECIFIED. CSM-364, University of Essex, Colchester.
Henson, M and Deutsch, M and Reeves, S (2002) CSM-364 - An analysis of operation refinement in Z. UNSPECIFIED. CSM-364, University of Essex, Colchester.
Henson, M and Deutsch, M and Reeves, S (2002) CSM-364 - An analysis of operation refinement in Z. UNSPECIFIED. CSM-364, University of Essex, Colchester.
Abstract
In this paper we analyse and compare several notions of operation refinement for specifications in Z. In particular we show that three theories: relational completion, proof-theoretic and functional (models) are all equivalent.
| 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/8674 |
Available files
Filename: csm-364.pdf