Communicating sequential processes
Communicating sequential processes
The Z notation: a reference manual
The Z notation: a reference manual
The RAISE specification language
The RAISE specification language
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
A Discipline of Programming
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
How to Combine Z with Process Algebra
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Unifying theories in proofpower-z
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Unifying theories in Isabelle/HOL
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Isabelle/circus: a process specification and verification environment
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Connectors as designs: Modeling, refinement and test case generation
Science of Computer Programming
Reasoning about i/o in functional programs
CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School
| Hi-index | 0.00 |
Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to prove properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a final reference for the Circus denotational semantics based on Hoare and He's Unifying Theories of Programming (UTP). Finally, it discusses the library of theorems on the UTP that was created and used in the proofs of the refinement laws.