Tool Support for the Circus Refinement Calculus

Authors:
Alessandro Cavalcante Gurgel;Cristiano Gurgel Castro;Marcel Vinicius Oliveira
Affiliations:
Departamento de Informática e Matemática Aplicada, UFRN, Brazil;Departamento de Informática e Matemática Aplicada, UFRN, Brazil;Departamento de Informática e Matemática Aplicada, UFRN, Brazil
Venue:
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Year:
2008

Citing 0
Cited 4

Formal Specification of a Cardiac Pacing System

FM '09 Proceedings of the 2nd World Congress on Formal Methods
A retrospective on CZT

Software—Practice & Experience
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Circuscombine both data and behavioural 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. Using a refinement calculus, we can correctly construct programs in a stepwise fashion. Each step is justified by the application of a refinement law, possibly with the discharge of proof obligations (hereafter called POs). The manual application of the refinement calculus, however, is an error-prone and hard task.