Getting to the Bottom of Relational Refinement: Relations and Correctness, Partial and Total

Boiten, Eerke Albert, De Roever, Willem-Paul (2003) Getting to the Bottom of Relational Refinement: Relations and Correctness, Partial and Total. In: Berghammer, R. and Möller, Bernhard, eds. 7th International Seminar on Relational Methods in Computer Science (RelMiCS 7). . pp. 82-88. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13981)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
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:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Funders:	Fachhochschule Kiel (https://ror.org/03q0ab227)
Depositing User:	Eerke Boiten
Date Deposited:	24 Nov 2008 18:01 UTC
Last Modified:	12 Jul 2022 10:39 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/13981 (The current URI for this page, for reference purposes)

University of Kent Author Information

Boiten, Eerke Albert.

Creator's ORCID:	https://orcid.org/0000-0002-9184-8968
CReDIT Contributor Roles:

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.