Data refinement by calculation
Acta Informatica
Duality in specification languages: a lattice-theoretical approach
Acta Informatica
Data refinement of predicate transformers
Theoretical Computer Science
Combining angels, demons and miracles in program specifications
Theoretical Computer Science
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
A Lattice-theoretical Basis for a Specification Language
Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
Recasting hoare and he's unifying theory of programs in the context of general correctness
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
UTP and temporal logic model checking
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Monadic maps and folds for multirelations in an allegory
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
| Hi-index | 0.01 |
Hoare and He's unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates, which supports development in several programming paradigms. The aim is the unification of languages and techniques, so that we can benefit from results in different contexts. In this paper, we investigate the integration of angelic nondeterminism in the UTP; we propose the unification of a model of binary multirelations, which is isomorphic to the monotonic predicate transformers model and can express angelic and demonic nondeterminism.