A tutorial introduction to unifying theories of programming

Woodcock, Jim and Cavalcanti, Ana L. C. (2004) A tutorial introduction to unifying theories of programming. In: Integrated Formal Methods In Integrated Formal Methods. Lecture Notes in Computer Science series, 2999. Springer-Verlag, Canterbury pp. 40-66. ISBN 3-540-21377-5. (doi:https://doi.org/10.1007/b96106) (Full text available)

Download (288kB) Preview
Official URL


In their Unifying Theories of Programming (UTP), Hoare & He use the alphabetised relational calculus to give denotational semantics to a wide variety of constructs taken from different programming paradigms. A key concept in their programme is the design: the familiar precondition-postcondition pair that describes the contract between a programmer and a client. We give a tutorial introduction to the theory of alphabetised relations, and its sub-theory of designs. We illustrate the ideas by applying them to theories of imperative programming, including Hoare logic, weakest preconditions, and the refinement calculus.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:01 UTC
Last Modified: 12 Jun 2014 08:47 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/14036 (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year