School of Computing

From circus to jcsp

M V M Oliveira, A L C Cavalcanti, and J C P Woodcock

In Sixth International Conference on Formal Engineering Methods, Lecture Notes in Computer Science series, pages 182-196. Springer, November 2004 To appear.

Abstract

Circus is a combination of Z, CSP, and Morgan's refinement calculus; it has an associated refinement strategy that supports the development of reactive programs. In this work, we present rules to translate Circus programs to Java programs that use JCSP, a library that implements CSP constructs. These rules can be used as a complement to the Circus algebraic refinement technique, or as a guideline for implementation. They are a link between the results on refinement in the context of Circus and a practical programming language in current use. The rules can also be used as the basis for a tool that mechanises the translation.



Bibtex Record

@inproceedings{1951,
author = {M V M Oliveira and A L C Cavalcanti and J C P Woodcock},
title = {From Circus to JCSP},
month = {November},
year = {2004},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {To appear},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2004/1951},
    publication_type = {inproceedings},
    submission_id = {11000_1093007310},
    booktitle = {Sixth International Conference on Formal Engineering Methods},
    series = {Lecture Notes in Computer Science series},
    publisher = {Springer},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014