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

Enabledness and Termination in Refinement Algebra

Kim Solin, Joakim von Wright, Enabledness and Termination in Refinement Algebra. Science of Computer Programming , 2007.

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:

@ARTICLE{jSoWr07a,
  title = {Enabledness and Termination in Refinement Algebra},
  author = {Solin, Kim and Wright, Joakim von},
  journal = {Science of Computer Programming},
  year = {2007},
}

Belongs to TUCS Research Unit(s): Software Construction Laboratorium

Publication Forum rating of this publication: level 2

Edit publication