%0 Journal Article %1 oliveira_08_utp %A Oliveira, Marcel %A Cavalcanti, Ana %A Woodcock, Jim %D 2009 %J Formal Aspects of Computing %K 2009 refinement semantics \_pdf utp circus %N 1-2 %P 3--32 %R http://dx.doi.org/10.1007/s00165-007-0052-5 %T A UTP semantics for Circus %U http://dx.doi.org/10.1007/s00165-007-0052-5 %V 21 %X Abstract   Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP constructs. Previously, a denotational semantics has been given to Circus; however, a shallow embedding of Circus in Z, in which the mapping from Circus constructs to their semantic representation as a Z specification, with yet another language being used as a meta-language, was not useful for proving properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a final reference for the Circus denotational semantics based on Hoare and He’s Unifying Theories of Programming (UTP); as such, it allows the proof of meta-theorems about Circus including the refinement laws in which we are interested. Its correspondence with the CSP semantics is illustrated with some examples. We also discuss the library of lemmas and theorems used in the proofs of the refinement laws. Finally, we give an account of the mechanisation of the Circus semantics and of the mechanical proofs of the refinement laws.

@article{oliveira_08_utp, abstract = {Abstract\^{A} \^{A}  Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP constructs. Previously, a denotational semantics has been given to Circus; however, a shallow embedding of Circus in Z, in which the mapping from Circus constructs to their semantic representation as a Z specification, with yet another language being used as a meta-language, was not useful for proving properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a final reference for the Circus denotational semantics based on Hoare and He\^{a}€™s Unifying Theories of Programming (UTP); as such, it allows the proof of meta-theorems about Circus including the refinement laws in which we are interested. Its correspondence with the CSP semantics is illustrated with some examples. We also discuss the library of lemmas and theorems used in the proofs of the refinement laws. Finally, we give an account of the mechanisation of the Circus semantics and of the mechanical proofs of the refinement laws.}, added-at = {2009-03-10T04:34:30.000+0100}, author = {Oliveira, Marcel and Cavalcanti, Ana and Woodcock, Jim}, biburl = {https://www.bibsonomy.org/bibtex/2edf34df51fdc276de749d1950eb449a8/leonardo}, citeulike-article-id = {2100610}, doi = {http://dx.doi.org/10.1007/s00165-007-0052-5}, interhash = {31ee197c71d1eaa1b06dc4523db8fdc6}, intrahash = {edf34df51fdc276de749d1950eb449a8}, journal = {Formal Aspects of Computing}, keywords = {2009 refinement semantics \_pdf utp circus}, month = {February}, number = {1-2}, pages = {3--32}, posted-at = {2007-12-12 21:32:06}, priority = {4}, timestamp = {2009-03-10T04:34:30.000+0100}, title = {A UTP semantics for Circus}, url = {http://dx.doi.org/10.1007/s00165-007-0052-5}, volume = 21, year = 2009 }