Mechanizing CSP Trace Theory in Higher Order Logic
IEEE Transactions on Software Engineering
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Using a PVS Embedding of CSP to Verify Authentication Protocols
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
ArcAngelC: a Refinement Tactic Language for Circus
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Aspects of Computing
ClawZ: cost-effective formal verification for control systems
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Unifying theories in proofpower-z
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Taking our own medicine: applying the refinement calculus to state-rich refinement model checking
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Unifying theories in Isabelle/HOL
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Mechanical reasoning about families of UTP theories
Science of Computer Programming
Isabelle/circus: a process specification and verification environment
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
| Hi-index | 0.00 |
Circus combines elements from sequential and reactive programming, and is especially suited for the development and verification of state-rich, reactive systems. In this paper we illustrate, by example, how a mechanisation of the UTP, and of a Circus theory, more specifically, can be used to encode particular Circus specifications. This complements previous work which focused on using the mechanised UTP semantics to prove general laws. We propose a number of extensions to an existing mechanisation by Oliveira to deal with the problems of type constraints and theory instantiation. We also show what the strategies and practical solutions are for proving refinement conjectures.