veriT: An Open, Trustable and Efficient SMT-Solver
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
A tactic language for refinement of state-rich concurrent specifications
Science of Computer Programming
Formal development of a cardiac pacemaker: from specification to code
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Integrating SMT-solvers in z and b tools
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Implementing tactics of refinement in CRefine
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
| Hi-index | 0.00 |
Circus specifications combine both data and behavioral aspects of concurrent systems using a combination of CSP, Z, and Dijkstra’s command language. Its associated refinement theory and calculus distinguishes itself from other such combinations. Recently, tools for Circus like a parser, a type-checker, a model-checker, and a translator to Java have been developed. Nevertheless, tool support for the Circus refinement calculus has only been prototyped. In this paper, we present CRefine, a tool that can be used throughout the refinement of concurrent systems in a calculational approach. Its functionalities are described using a simple case study. Furthermore, we also describe CRefine’s architecture and its integration to the CZT framework.