Nuka, Gift, Woodcock, Jim (2004) Mechanising the alphabetised relational calculus. In: WMF2003: 6th Braziliam Workshop on Formal Methods. Electronic Notes in Theoretical Computer Science , 95. pp. 209-225. Elsevier, Campina Grande, Brazil (doi:10.1016/j.entcs.2004.04.013) (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:14035)
| 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.1016/j.entcs.2004.04.013 |
Abstract
In Hoare and He's unifying theories of programming, the alphabetised relational calculus is used to describe and relate different programming paradigms, including functional, imperative, logic, and parallel programming. In this paper, we give a formal semantics of the alphabetised relational calculus, and use our definition to create a deep embedding of the calculus in Z. This allows us to use one of the standard theorem provers for Z, in order to provide mechanised support for reasoning about programs in the unifying theory
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| DOI/Identification number: | 10.1016/j.entcs.2004.04.013 |
| Additional information: | To be published in Electronic Notes in Theoretical Computer Science 2004 |
| Uncontrolled keywords: | Relational Calculus; Verification; UTP |
| 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:01 UTC |
| Last Modified: | 05 Nov 2024 09:48 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/14035 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
