White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Angelic Nondeterminism in the Unifying Theories of Programming

Cavalcanti, A., Woodcock, J. and Dunne, S. (2006) Angelic Nondeterminism in the Unifying Theories of Programming. Formal Aspects of Computing, 18 (3). pp. 288-307. ISSN 0934-5043

Full text not available from this repository.


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.

Item Type: Article
Keywords: Semantics - Refinement - Relations - Predicate transformers
Institution: The University of York
Academic Units: The University of York > Computer Science (York)
Depositing User: York RAE Import
Date Deposited: 28 Aug 2009 15:43
Last Modified: 28 Aug 2009 15:43
Published Version: http://dx.doi.org/10.1007/s00165-006-0001-8
Status: Published
Publisher: Springer Science + Business Media
Identification Number: 10.1007/s00165-006-0001-8
URI: http://eprints.whiterose.ac.uk/id/eprint/6154

Actions (repository staff only: login required)