TY - JOUR
T1 - Angelic nondeterminism in the unifying theories of programming
AU - Cavalcanti, A. (Ana)
AU - Woodcock, J. C. P. (Jim)
AU - Dunne, S. E. (Steve)
N1 - Author can archive post-print (ie final draft post-refereeing). For full details see http://www.sherpa.ac.uk/romeo/ [Accessed 12/11/09]
PY - 2006/9
Y1 - 2006/9
N2 - 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.
AB - 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.
U2 - 10.1007/s00165-006-0001-8
DO - 10.1007/s00165-006-0001-8
M3 - Article
SN - 0934-5043
VL - 18
SP - 288
EP - 307
JO - Formal Aspects of Computing
JF - Formal Aspects of Computing
IS - 3
ER -