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

Refinement Algebra with Operators for Enabledness and Termination

Kim Solin, Joakim von Wright, Refinement Algebra with Operators for Enabledness and Termination. In: Mathematics of Program Construction, 8th International Conference, MPC 2006, Lecture Notes in Computer Science 4014, 397–415, Springer, 2006.

Abstract:

Refinement algebras are abstract algebras for reasoning
about programs in a total-correctness framework. We extend a reduct
of von Wright’s demonic refinement algebra with two operators for modelling
enabledness and termination of programs. We show how the operators
can be used for expressing relations between programs and apply
the algebra to reasoning about action systems.

BibTeX entry:

@INPROCEEDINGS{inpSoWr06a,
  title = {Refinement Algebra with Operators for Enabledness and Termination},
  booktitle = {Mathematics of Program Construction, 8th International Conference, MPC 2006},
  author = {Solin, Kim and Wright, Joakim von},
  volume = {4014},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  pages = {397–415},
  year = {2006},
}

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

Publication Forum rating of this publication: level 1

Edit publication