Predicate calculus and program semantics
Predicate calculus and program semantics
Category theory for computing science
Category theory for computing science
Programming from specifications
Programming from specifications
A calculus of functions for program derivation
Research topics in functional programming
Inductive data types for predicate transformers
Information Processing Letters
Algebra of programming
Elements of a Relational Theory of Datatypes
Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Forward and Backward Simulations for Timing-Based Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Compound monads in specification languages
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Structures with Multirelations, their Discrete Dualities and Applications
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Monadic maps and folds for multirelations in an allegory
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Algebra of monotonic boolean transformers
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
A Coalgebraic Perspective on Logical Interpretations
Studia Logica
| Hi-index | 0.00 |
This paper presents an introduction to a calculus of binary multirelations, which can model both angelic and demonic kinds of non-determinism. The isomorphism between up-closed multirelations and monotonic predicate transformers allows a different view of program transformation, and program transformation calculations using multirelations are easier to perform in some circumstances. Multirelations are illustrated by modelling both kinds of nondeterministic behaviour in games and resource-sharing protocols.