@inproceedings{
    preoteasa-2011,
    editor = "Simao, Adenilso and Morgan, Carroll",
    author = "Preoteasa, Viorel",
    publisher = "Springer Berlin Heidelberg",
    title = "Algebra of Monotonic Boolean Transformers",
    series = "Lecture Notes in Computer Science",
    booktitle = "Formal Methods, Foundations and Applications. Proceedings of Brazilian Symposium on Formal Methods (SBMF 2011)",
    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).",
    volume = "7021",
    flags = "copy",
    year = "2011",
    pdf = "preoteasa-2011.pdf",
    pages = "140-155"
}