Communicating sequential processes
Communicating sequential processes
A classical mind: essays in honour of C. A. R. Hoare
A classical mind: essays in honour of C. A. R. Hoare
A classical mind
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Towards a Refinement Calculus for Object Systems
ICCI '02 Proceedings of the 1st IEEE International Conference on Cognitive Informatics
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
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Towards Mobile Processes in Unifying Theories
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
A concurrent language for refinement
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
| Hi-index | 0.00 |
Circus is a combination of Z, CSP, and the refinement calculus, and is based on Hoare & He's Unifying Theories of Programming. A model checker is being constructed for the language to conduct refinement checking in the style of FDR, but supported by theorem proving for reasoning about the complex states and data types that arise from the use of Z. FDR deals with bounded labelled transition systems (LTSs), but the Circus model checker manipulates LTSs with possibly infinite inscriptions on arcs and in nodes, and so, in general, the success or failure of a refinement check depends on interaction with a theorem prover. An LTS is generated from a source text using an operational interpretation of Circus; we present a Structured Operational Semantics for Circus, including both its process-algebraic and state-rich features.