Nuka, Gift and Woodcock, Jim (2006) Mechanising a Unifying Theory. In: Unifying Theories of Programming. Lecture Notes in Computer Science, 4010 . Springer, Berlin, pp. 217-35. ISBN 978-3-540-34750-7.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
In this paper, we present a formalisation of a subset of the unifying theories of programming (UTP). In UTP, the alphabetised relational calculus is used to describe and relate different programming paradigms, including functional, imperative, logic, and parallel programming. We develop a verification framework for UTP; we give a formal semantics to an imperative programming language, and use our definitions to create a deep embedding of the language in Z. We use ProofPowerZ, a theorem prover for Z to provide mechanised support for reasoning about programs in the unifying theory.
|Item Type:||Book section|
|Uncontrolled keywords:||UTP, program verification, formal methods|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:04|
|Last Modified:||06 Jul 2009 13:14|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/14500 (The current URI for this page, for reference purposes)|
- Depositors only (login required):