Advertisement

Formal Aspects of Computing

, Volume 15, Issue 2–3, pp 146–181 | Cite as

A Refinement Strategy for Circus

  • Ana Cavalcanti
  • Augusto Sampaio
  • Jim Woodcock
Article

Abstract

We present a refinement strategy for Circus, which is the combination of Z, CSP, and the refinement calculus in the setting of Hoare and He’s unifying theories of programming. The strategy unifies the theories of refinement for processes and their constituent actions, and provides a coherent technique for the stepwise refinement of concurrent and distributed programs involving rich data structures. This kind of development is carried out using Circus’s refinement calculus, and we describe some of its laws for the simultaneous refinement of state and control behaviour, including the splitting of a process into parallel subcomponents. We illustrate the strategy and the laws using a case study that shows the complete development of a small distributed program.

Keywords

Concurrency CSP Program development 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BCS 2003

Authors and Affiliations

  • Ana Cavalcanti
    • 1
  • Augusto Sampaio
    • 2
  • Jim Woodcock
    • 1
  1. 1.Computing LaboratoryUniversity of Kent at CanterburyCanterburyUK
  2. 2.Centro de InformáticaUniversidade Federal de PernambucoRecife PEBrazil

Personalised recommendations