Location of Repository

A Weakest Precondition Semantics for Circus

By Ana L. C. Cavalcanti and Jim Woodcock


Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus. Our main objective is the definition of refinement methods for concurrent programs. The original semantic model for Circus is Hoare and He's unifying theories of programming. In this paper, we present an equivalent semantics based on predicate transformers. With this new model, we provide a more adequate basis for the formalisation of refinement and verification condition generating rules. Furthermore, this new framework makes it possible to include logical variables and angelic nondeterminism in Circus. The consistency of the relational and predicate transformer models gives us confidence in their accuracy

Topics: QA76
Publisher: IOS Press
Year: 2002
OAI identifier: oai:kar.kent.ac.uk:13677
Sorry, our data provider has not provided any external links therefor we are unable to provide a PDF.

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.