• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

An Outline of a Dually Nondeterministic Refinement Algebra with Negation

Kim Solin, An Outline of a Dually Nondeterministic Refinement Algebra with Negation. In: John Power Peter Mosses, Monika Seisenberger (Eds.), CALCO Young Researchers Workshop 2005. Selected Papers, Univ. of Wales, Swansea Report Series, 85-98, Univ. of Wales, Swansea, 2005.

Abstract:

A dually nondeterministic refinement algebra with a negation
operator is proposed. The algebra facilitates reasoning about
total-correctness preserving program transformations and nondeterministic
programs. The negation operator is used to express enabledness and
termination operators through a useful explicit definition. As a small application, a property of action systems is proved employing the algebra.

BibTeX entry:

@INPROCEEDINGS{inpSolin05a,
  title = {An Outline of a Dually Nondeterministic Refinement Algebra with Negation},
  booktitle = {CALCO Young Researchers Workshop 2005. Selected Papers},
  author = {Solin, Kim},
  series = {Univ. of Wales, Swansea Report Series},
  editor = {Peter Mosses, John Power and Monika Seisenberger},
  publisher = {Univ. of Wales, Swansea},
  pages = {85-98},
  year = {2005},
  keywords = {refinement algebra, dual nondeterminism, negation, action systems},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication