Boiten, Eerke and De Roever, Willem-Paul (2003) Getting to the Bottom of Relational Refinement: Relations and Correctness, Partial and Total. In: 7th International Seminar on Relational Methods in Computer Science (RelMiCS 7).
| The full text of this publication is not available from this repository. (Contact us about this Publication) | |
| Official URL http://www.cs.kent.ac.uk/pubs/2003/1589 |
Abstract
Relational theories of refinement using simulations exist based on total and on partial relations, modelling partial and total correctness. In order to model partialities such as non-termination and deadlock, domains of relations are often extended with, or assumed to include, a ``bottom'' value bot. This paper explores a number of such theories, all providing sound and jointly complete notions of simulations, concentrating on the role of bot.
| Item Type: | Conference or workshop item (UNSPECIFIED) |
|---|---|
| Uncontrolled keywords: | refinement, total correctness, partial correctness, relations |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 24 Nov 2008 18:01 |
| Last Modified: | 24 Apr 2012 14:12 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/13981 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
