A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming from specifications
Programming from specifications
Mechanizing CSP Trace Theory in Higher Order Logic
IEEE Transactions on Software Engineering
Mechanizing programming logics in higher order logic
Current trends in hardware verification and automated theorem proving
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Encoding Z-style schemas in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Object-oriented software engineering with Eiffel
Object-oriented software engineering with Eiffel
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Predicative programming Part I
Communications of the ACM
Predicative programming Part II
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
A mechanized theory of the &pi-calculus in Hol
Nordic Journal of Computing
Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Mechanical Reasoning about Families of UTP Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding circus programs in ProofPower-Z
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Saoithín: a theorem prover for UTP
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Mechanical reasoning about families of UTP theories
Science of Computer Programming
| Hi-index | 0.00 |
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.