Cavalcanti, A., Sampaio, A. and Woodcock, J. (2003) A refinement strategy for circus. Formal Aspects of Computing, 15 (2-3). pp. 146-181. ISSN 0934-5043Full text not available from this repository.
We present a refinement strategy for Circus, which is the combination of Z, CSP, and the refinement calculus in the setting of Hoare and Hes 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 Circuss 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.
|Academic Units:||The University of York > Computer Science (York)|
|Depositing User:||York RAE Import|
|Date Deposited:||24 Jul 2009 09:44|
|Last Modified:||24 Jul 2009 09:44|
|Publisher:||Springer Science + Business Media|
Actions (login required)