Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Compilation and Synthesis for Real-Time Embedded Controllers
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Enforcing behavior with contracts
Programming methodology
Terms with unbounded demonic and angelic nondeterminacy
Science of Computer Programming
Dually nondeterministic functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Term transformers: A new approach to state
ACM Transactions on Programming Languages and Systems (TOPLAS)
Angelic Nondeterminism and Unifying Theories of Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
On two dually nondeterministic refinement algebras
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Algebra of monotonic boolean transformers
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
Interpreting nondeterminism in the refinement calculus
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Hi-index | 0.00 |
A very general lattice-based language of commands, based on theprimitive operations of substitution and test for equality, isconstructed. This base language permits unbounded nondeterminism,demonic and angelic nondeterminism. A dual language permitting miraclesis constructed. Combining these two languages yields an extended baselanguage which is complete, in the sense that all monotonic predicatetransformers can be constructed in it. The extended base languageprovides a unifying framework for various specification languages; weshow how two Dijkstra-style specification languages can be embedded init.—Authors' Abstract