@article{
    preoteasa2013,
    author = "Preoteasa, Viorel",
    volume = "92",
    responsibleauthor = "Preoteasa, Viorel",
    issn = "0167-6423",
    keyword = "",
    language = "eng",
    title = "Refinement algebra with dual operator",
    journal = "Science of Computer Programming",
    publisher = "Elsevier",
    pdf = "preoteasa-2013.pdf",
    abstract = "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).",
    juforank = "2",
    affiliation = "Department of Information Technologies, Åbo Akademi University, Joukahaisenkatu 3-5 A, 20520 Turku, Finland",
    doi = "10.1016/j.scico.2013.07.002",
    flags = "copy",
    il = "no",
    eventdetails = "NA",
    year = "2014",
    unitcode = "T306-100",
    kay = "NA",
    impactfactor = "A1",
    pages = "179-210"
}