Mechanised Translation of Control Law Diagrams into Circus
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Mechanical Reasoning about Families of UTP Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
The Denotational Semantics of slotted-Circus
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A timeband framework for modelling real-time systems
Real-Time Systems
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
A note on traces refinement and the conf relation in the unifying theories of programming
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Unifying input output conformance
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
The miracle of reactive programming
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Encoding circus programs in ProofPower-Z
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Specification coverage for testing in circus
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
On modelling user observations in the UTP
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Unifying theories of confidentiality
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Saoithín: a theorem prover for UTP
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Proceedings of the 8th International Conference on Frontiers of Information Technology
A tactic language for refinement of state-rich concurrent specifications
Science of Computer Programming
Automating refinement of circus programs
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Specifying confidentiality in circus
FM'11 Proceedings of the 17th international conference on Formal methods
The safety-critical Java memory model: a formal account
FM'11 Proceedings of the 17th international conference on Formal methods
Safety-critical Java in Circus
Proceedings of the 9th International Workshop on Java Technologies for Real-Time and Embedded Systems
The safety-critical java mission model: a formal account
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Mechanical reasoning about families of UTP theories
Science of Computer Programming
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
A UTP semantics of pGCL as a homogeneous relation
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Testing with inputs and outputs in CSP
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Safety-critical Java programs from Circus models
Real-Time Systems
Simulink timed models for program verification
Theories of Programming and Formal Methods
Modelling temporal behaviour in complex systems with Timebands
Formal Methods in System Design
Hi-index | 0.00 |
Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP constructs. Previously, a denotational semantics has been given to Circus; however, a shallow embedding of Circus in Z, in which the mapping from Circus constructs to their semantic representation as a Z specification, with yet another language being used as a meta-language, was not useful for proving 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); as such, it allows the proof of meta-theorems about Circus including the refinement laws in which we are interested. Its correspondence with the CSP semantics is illustrated with some examples. We also discuss the library of lemmas and theorems used in the proofs of the refinement laws. Finally, we give an account of the mechanisation of the Circus semantics and of the mechanical proofs of the refinement laws.