A Denotational Semantics for Circus

Oliveira, Marcel; Cavalcanti, Ana; Woodcock, Jim

doi:10.1016/j.entcs.2006.08.047

Cited by 31 publications

(18 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2). Similar to other specification constructs in Isabelle/HOL, this syntax is "parsed away", i. e. compiled into an internal representation of the denotational semantics of Circus, which is a formalization in form of a shallow embedding of the (essentially untyped) paper-and-pencil definitions by Oliveira et al [12], based on UTP. Circus actions are defined as CSP healthy reactive processes.…”

Section: Isabelle/circusmentioning

confidence: 99%

“…It follows the failure/divergence semantics [14], (but coined in terms of the UTP [12]) providing a notion of execution trace tr, refusals ref, and divergences. It is expressed in terms of the UTP [10] which makes it amenable to other refinement-notions in UTP.…”

Section: Circus and Its Utp Foundationmentioning

confidence: 99%

“…To represent the recursion operator "µ" over actions, we use the universal least fix-point operator "lfp" defined in the HOL library for lattices and we follow again [12]. The use of least fix-points in [12] is the most substantial deviation from the standard CSP denotational semantics, which requires Scottdomains and complete partial orderings. The operator lfp is inherited from the "Complete Lattice class" under some conditions, and all theorems defined over this operator can be reused.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Isabelle/Circus: A Process Specification and Verification Environment

Feliachi

Gaudel

Wolff

2012

Verified Software: Theories, Tools, Experiments

View full text Add to dashboard Cite

Résumé Circus est un langage de spécification qui permet de spécifier des structures de données et des comportements complexes. Sa sémantique est basée sur le modèle UTP (unifying theories of programming) proposé par Hoare et He. Nous proposons, sur la base de Isabelle/UTP, notre théorie de la sé-mantique de UTP en Isabelle/HOL, une sémantique formelle mécanisée, basée sur une intégration superficielle (shallow-embedding) de Circus en Isabelle/UTP. Nous dérivons des règles de preuveà partir de cette sémantique et mettons en oeuvre des tactiques qui permettent d'écrire des preuves de raffinement sur des processus Circus (impliquantà la fois des données et des comportements complexes). Afin de faciliter son utilisation, l'environnement de preuve développé supporte une syntaxe très proche de la représentation textuelle de Circus.Abstract The Circus specification language combines elements for complex data and behavior specifications, using an integration of Z and CSP with a refinement calculus. Its semantics is based on Hoare and He's unifying theories of programming (UTP). Based on Isabelle/UTP, our semantic theory of UTP based on Isabelle/HOL, we develop a machine-checked, formal semantics based on a "shallow embedding" of Circus in Isabelle/UTP. We derive proof rules from this semantics and implement tactic support that finally allows for proofs of refinement for Circus processes (involving both data and behavioral aspects). This proof environment supports a syntax for the semantic definitions which is close to textbook presentations of Circus.

show abstract

Section: Isabelle/circusmentioning

confidence: 99%

Section: Circus and Its Utp Foundationmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Isabelle/Circus: A Process Specification and Verification Environment

Feliachi

Gaudel

Wolff

2012

Verified Software: Theories, Tools, Experiments

View full text Add to dashboard Cite

show abstract

“…At the time of writing, work is underway to take the SCXML sources and translate them to Circus [OCW06], to allow them to be analysed against the toplevel Z models we already have. We also propose to use the same sources with new translations to do some comparative work by re-targeting at tools used with other formalisms.…”

Section: Future Workmentioning

confidence: 99%

Concurrent Models of Flash Memory Device Behaviour

Butterfield

Catháin

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a CSP model of the internal behaviour of Flash Memory, based on its specification by the Open Nand-Flash Interface (ONFi) consortium. This contributes directly to the low-level modelling of the data-storage technology that is the target of the POSIX filestore mini-challenge. The key objective was to ensure that the internal behaviour was well-specified, and that it was consistent with the specification of the external interface of such devices. The FDR toolkit was used to perform the revelent refinement/model-checking. In addition to uncovering errors and possible sources of misinterpretation in the ONFi standard, this work also describes a methodology for model data-entry based on a "state-chart" dialect of XML (SCXML) using XSLT to translate into CSP, and HTML, to support validation.

show abstract

“…UTP was proposed by Hoare and He in [10], and aims to formalize the similar features of different languages in a similar style. UTP has been proved to be appropriate for formal semantics of various programming languages and specification languages like Circus [15], TCOZ [17], rCOS [11] and Reo [20]. We believe it is also well suited for developing a proper formal foundation of cloud computing.…”

Section: Introductionmentioning

confidence: 99%

A Formal Design Model for Cloud Services

Sun¹,

Fu²

2017

International Conferences on Software Engineering and Knowledge Engineering

View full text Add to dashboard Cite

Abstract-To support rigorous development of cloud applications, a formal model for understanding and reasoning about cloud services is needed. Unifying Theories of Programming (UTP) provide a formal semantic foundation for various expressive programming and specification languages. A key concept in UTP is design: the familiar pre / post-condition pair that describes a contract. In this paper we use UTP to provide a formal model for cloud computing, whereby cloud services are interpreted as designs in UTP. Refinement and equivalence relations between cloud services can be naturally established by implication between predicates. A family of composition operators that can be used to put different cloud services together to construct more complex services and applications are defined based on the design model for cloud services. On the other hand, dynamic reconfiguration of cloud applications can be dealt with in the context of the design model as well, by applying the reconfiguration rules on the design models for the corresponding applications.

show abstract

A Denotational Semantics for Circus

Cited by 31 publications

References 3 publications

Isabelle/Circus: A Process Specification and Verification Environment

Isabelle/Circus: A Process Specification and Verification Environment

Concurrent Models of Flash Memory Device Behaviour

A Formal Design Model for Cloud Services

Contact Info

Product

Resources

About