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. (doi:10.1007/11768173_13) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:14500)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
| Official URL: http://dx.doi.org/10.1007/11768173_13 |
Abstract
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 |
|---|---|
| DOI/Identification number: | 10.1007/11768173_13 |
| Uncontrolled keywords: | UTP, program verification, formal methods |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 24 Nov 2008 18:04 UTC |
| Last Modified: | 16 Nov 2021 09:52 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/14500 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
