Operational Semantics for Model Checking Circus

@inproceedings{Woodcock2005OperationalSF,
  title={Operational Semantics for Model Checking Circus},
  author={Jim Woodcock and Ana Cavalcanti and Leo Freitas},
  booktitle={FM},
  year={2005}
}
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… 
Testing for refinement in Circus
TLDR
This work presents the Circus testing theory, a UTP-based generalisation of failures-divergences refinement that considers data modelling and the basis for test-generation techniques that can combine coverage criteria for data and transition models.
Model-checking circus with FDR using circus2csp
TLDR
An automatic tool is used to implement an automatic tool which preserves the semantics while translating Circus to CSP, which includes an automatic Circus refinement calculator as part of the transformation before the translation into CSP and introduces a set of translation rules for using Z schemas as Circus actions, not previously supported in the translation Into CSP.
A UTP semantics for Circus
TLDR
This work presents a final reference for the Circus denotational semantics based on Hoare and He’s Unifying Theories of Programming (UTP) that allows the proof of meta-theorems about Circus including the refinement laws in which it is interested.
A process algebraic framework for specification and validation of real-time systems
TLDR
This paper introduces Circus Time, a timed extension of Circus, and presents a new UTP time theory, which is used to give semantics to Circus Time and to validate some of its laws, and provides a framework for validation of timed programs based on FDR, the CSP model-checker.
Model-Checking Circus State-Rich Specifications
TLDR
This paper foster the reuse of theoretical results underpinned on CSP to Circus by providing a sound mapping for processes and refinement from Circus to CSP, proved sound from an existing link between these languages.
Model checking CML: tool development and industrial applications
TLDR
This paper shows how to create a model checker for L, using a development approach based on its operational semantics and a systematic semantics embedding and the formal modeling using logic programming and analysis (FORMULA) framework to this end.
A Sound Operational Semantics for Circus
TLDR
This work provides a full and sound Structural Operational Semantics for Circus, a formal notation that combines Z and CSP that lifts the works of Freitas, Cavalcanti and Woodcock by creating rules that deal with any Circus construct.
Towards a Model-Checker for Circus
TLDR
This paper aims at model-checking the Open image in new window notation that combines Z, CSP, and Morgan’s refinement calculus, based on the Unifying Theories of Programming.
An Architecture for Circus Tools
TLDR
An ongoing effort of Community Z Tools (CZT) that implements tools for Standard Z that includes a specification processing front-end that allows parsing, prettyprinting, and typechecking of Circus; a theorem proving module; and a compiler useful for animation and prototyping.
Model checking of state-rich formalisms (by linking to combination of state-based formalism and process algebra)
TLDR
This thesis presents a new approach to model-check state-rich formalisms by linking them to a combination of a state-based formalism and a process algebra and proves its benefits by finding a substantial number of errors from the original Circus solution.
...
...

References

SHOWING 1-10 OF 44 REFERENCES
Predicate transformers in the semantics of Circus
TLDR
A more adequate basis for the formalisation of refinement and verification-condition generation rules is provided and this framework makes it possible to include logical variables and angelic nondeterminism in Circus.
Refinement in Circus
TLDR
This work defines the meaning of refinement of processes and their actions, and proposes a sound data refinement technique for process refinement in Circus, a concurrent specification language that integrates imperative CSP, Z, and the refinement calculus.
A Refinement Strategy for Circus
TLDR
A refinement strategy for Circus is presented, which is the combination of Z, CSP, and the refinement calculus in the setting of Hoare and He’s unifying theories of programming, which provides a coherent technique for the stepwise refinement of concurrent and distributed programs involving rich data structures.
Refinement of actions in Circus
Concurrent and Real-time Systems: The CSP Approach
TLDR
The second half of the book introduces time into the language, brings in the timed semantic model (timed failures) and finally presents the theory of timewise refinement which links the two halves together.
A Concurrent Language for Refinement
TLDR
A combination of the well-established formal specification languages Z and CSP is presented, aimed at the calculational refinement of specifications to programs written in a language similar to occam and Handel-C.
Parallel algorithms for dead-lock and livelock analysis of concurrent systems
TLDR
This work presents parallelised model-checking algorithms for deadlock and livelock analysis and describes their implementation and finds the techniques are found to scale well running either on a conventional supercomputer or on a PC cluster.
Towards a Time Model for Circus
TLDR
An abstraction function is created that maps the timed model to the original model of Circus to create a relation between the two models and allows the exploration of some properties of the timed semantics in the untimed model.
The Semantics of Circus
TLDR
The language of Circus is described and the formalisation of its model is described in Hoare & He's unifying theories of programming.
ZB 2002:Formal Specification and Development in Z and B
TLDR
Theories, Implementations, and Transformations: Incremental Proof of the Producer/Consumer Property for the PCI Protocol, and Handling Inconsistencies in Z Using Quasi-Classical Logic.
...
...