A Refinement Strategy for Circus |
| |
Authors: | Ana Cavalcanti Augusto Sampaio Jim Woodcock |
| |
Affiliation: | (1) Computing Laboratory, University of Kent at Canterbury, Canterbury, CT2 7NF, UK;(2) Centro de Informática, Universidade Federal de Pernambuco, Recife PE, Brazil |
| |
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 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. |
| |
Keywords: | Concurrency CSP Program development Z |
本文献已被 SpringerLink 等数据库收录! |
|