School of Computing

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

Eerke Boiten and Willem-Paul de Roever

In R. Berghammer and B. M"oller, editors, 7th International Seminar on Relational Methods in Computer Science (RelMiCS 7), pages 82-88. University of Kiel, May 2003.

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$.

Download publication 216 kbytes (PostScript)

Bibtex Record

@inproceedings{1589,
author = {Eerke Boiten and Willem-Paul de Roever},
title = {{Getting to the Bottom of Relational Refinement: Relations and Correctness, Partial and Total}},
month = {May},
year = {2003},
pages = {82-88},
keywords = {refinement, total correctness, partial correctness, relations},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2003/1589},
    publication_type = {inproceedings},
    submission_id = {16820_1048005578},
    booktitle = {7th International Seminar on Relational Methods in Computer Science (RelMiCS 7)},
    editor = {R. Berghammer and B. M"oller},
    organization = {University of Kiel},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 12/03/2012 17:16