Algebra of Monotonic Boolean Transformers (Q7361636)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry MonoBoolTranAlgebra
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algebra of Monotonic Boolean Transformers |
AFP entry MonoBoolTranAlgebra |
Statements
22 September 2011
0 references
Viorel Preoteasa
0 references
Algebra of Monotonic Boolean Transformers (English)
0 references
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 formalize here an algebra which can be used to model total correctness, refinement, demonic and angelic choice. The basic model of this algebra are monotonic Boolean transformers (monotonic functions from a Boolean algebra to itself).
0 references
0 references
