From Circus to JCSP

Oliveira, Marcel V. M. and Cavalcanti, Ana L. C. and Woodcock, Jim (2004) From Circus to JCSP. In: Sixth International Conference on Formal Engineering Methods, Nov 08-12, 2004, Seattle, WA, . (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not available from this repository. (Contact us about this Publication)

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.

Item Type: Conference or workshop item (UNSPECIFIED)
Additional information: To appear
Uncontrolled keywords: concurrency, object-orientation, program development
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:01
Last Modified: 12 Jun 2014 08:47
Resource URI: https://kar.kent.ac.uk/id/eprint/14062 (The current URI for this page, for reference purposes)
  • Depositors only (login required):