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

Algebra of Monotonic Boolean Transformers

Viorel Preoteasa, Algebra of Monotonic Boolean Transformers. In: A. Simao, C. Morgan (Eds.), SBMF 2011, Lecture Notes in Computer Science 7021, 140–155, Springer, 2011.

http://dx.doi.org/10.1007/978-3-642-25032-3_10

Abstract:

Algebras of imperative programming languages have been successful in reasoning about programs. In general an algebra of programs is an algebraic structure with programs as elements and with program compositions (sequential composition, choice, skip) as algebra operations. Various versions of these algebras were introduced to model partial correctness, total correctness, refinement, demonic choice, and other aspects. We introduce here an algebra which can be used to model total correctness, refinement, demonic and angelic choice. The basic model of our algebra are monotonic Boolean transformers (monotonic functions from a Boolean algebra to itself).

Files:

Full publication in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpPreoteasa_Viorel11a,
  title = {Algebra of Monotonic Boolean Transformers},
  booktitle = {SBMF 2011},
  author = {Preoteasa, Viorel},
  volume = {7021},
  series = {Lecture Notes in Computer Science},
  editor = {Simao, A. and Morgan, C.},
  publisher = {Springer},
  pages = {140–155},
  year = {2011},
}

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

Publication Forum rating of this publication: level 1

Edit publication