Communicating sequential processes
Communicating sequential processes
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
CSP-OZ: a combination of object-Z and CSP
FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
Unifying Theories of Parallel Programming
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Towards a Time Model for Circus
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Non-Interference Through Determinism
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
Using a Process Algebra to Control B Operations
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
The state-based CCS semantics for concurrent Z specification
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
A Denotational Semantics for Circus
Electronic Notes in Theoretical Computer Science (ENTCS)
ArcAngelC: a Refinement Tactic Language for Circus
Electronic Notes in Theoretical Computer Science (ENTCS)
Mechanical Reasoning about Families of UTP Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Supporting ArcAngel in ProofPower
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
Unifying theories in Isabelle/HOL
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Refinement-oriented models of Stateflow charts
Science of Computer Programming
| Hi-index | 0.00 |
The increasing interest in the combination of different computational paradigms is very well represented by Hoare & He in the Unifying Theories of Programming. In this paper, we present a mechanisation of part of that work in a theorem prover, ProofPower-Z; the theories of alphabetised relations, designs, reactive and CSP processes are in the scope of this paper. An account of how this mechanisation is done, and more interestingly, of what issues were raised and of our decisions, is presented here. We aim at providing tool support for further explorations of Hoare & He’s unification, and for the mechanisation of languages based on this unification. More specifically, Circus, a specification language that combines Z, CSP, specification statements, and Dijkstra’s guarded command language is our final target.