Data refinement by calculation
Acta Informatica
The Z notation: a reference manual
The Z notation: a reference manual
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Blending Object-Z and Timed CSP: an introduction to TCOZ
Proceedings of the 20th international conference on Software engineering
A guide to MATLAB: for beginners and experienced users
A guide to MATLAB: for beginners and experienced users
ESOP '86 Proceedings of the European Symposium on Programming
How to Combine Z with Process Algebra
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Using a Process Algebra to Control B Operations
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Refine and Gabriel: Support for Refinement and Tactics
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Verification of Control Systems using Circus
ICECCS '06 Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems
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)
Supporting ArcAngel in ProofPower
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding circus programs in ProofPower-Z
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
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
Mechanical reasoning about families of UTP theories
Science of Computer Programming
Refinement-oriented models of Stateflow charts
Science of Computer Programming
| Hi-index | 0.00 |
Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and calculus are distinctive, but refinements may be long and repetitive, and using this technique can be hard. Some useful strategies have already been identified, described, and used. By documenting and using them as tactics, a lot can be gained since they can be repeatedly used as single transformation rules. Here, we present ArcAngelC, a language for defining such refinement tactics; we present the language and its application in the formalisation of an existing informal strategy for verification of Ada implementations of control systems.