Angelic nondeterminism in the unifying theories of programming

Authors:
Ana Cavalcanti;Jim Woodcock;Steve Dunne
Affiliations:
Department of Computer Science, University of York, YO10 5DD, York, England;Department of Computer Science, University of York, YO10 5DD, York, England;School of Computing, University of Teesside, TS1 3BA, Middlesbrough, England
Venue:
Formal Aspects of Computing
Year:
2006

Citing 0
Cited 4

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
Chorus angelorum

B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Simulink timed models for program verification

Theories of Programming and Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hoare and He’s unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates; it supports development in several programming paradigms. The aim of Hoare and He’s work 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.