Examples of program composition illustrating the use of universal properties

Charpentier, Michel; Chandy, K. Mani

doi:10.1007/bfb0098004

Cited by 11 publications

(21 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have started to explore the use of our transformers in conjunction with temporal logics. Several guarantees-based specifications and proofs have been written in a Unity-like linear temporal logic [11,12,7] and in the branching-time logic CTL [6]. In order to do this, one has to define proof rules for specifications of the form W E.X within the chosen logic.…”

Section: Discussionmentioning

confidence: 99%

“…Rules relative to Unity-like logics have been defined in [10,12]. They have also been mechanized with the higher-order theorem prover Isabelle, and hand-written proofs from [11,12,14] have been redone using the prover [33,19]. We now need to further investigate the use of transformers other than W E, as well as to explore application to other specification languages.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Specification transformers: a predicate transformer approach to composition

Charpentier

Chandy

2004

Acta Informatica

Self Cite

View full text Add to dashboard Cite

Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and the composition operator, and (ii) deducing desirable properties of components from the system specification and properties of the composition operator. The paper studies compositional systems in general without making assumptions that components are computer programs. The results obtained from such abstract representations are general but also weaker than results that can be obtained from more restrictive assumptions such as assuming that systems are parallel compositions of concurrent programs. Explorations of general theories of composition can help identify fundamental issues common to many problem domains. The theory presented here is based on predicate transformers.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Specification transformers: a predicate transformer approach to composition

Charpentier

Chandy

2004

Acta Informatica

Self Cite

View full text Add to dashboard Cite

show abstract

“…Nevertheless, we do not forget our interest in temporal logics and concurrent systems. We have used existential and universal properties to derive examples of specifications and correctness proofs of distributed and concurrent systems [11,12,6,25]. Several of these examples make use of an operator called guarantees [8] which has been proved to be a special case of the transformer W E [14].…”

Section: Discussionmentioning

confidence: 99%

An Approach to Composition Motivated by wp

Charpentier

2002

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. We consider the question of composition in system design, a fundamental issue in engineering. More precisely, we are interested in deducing system properties from components properties and vice-versa. This requires system and component specifications to be "compositional " in some sense. Depending on what systems are and how they are composed, this problem is satisfactorily solved (e.g., sequential composition of terminating programs) or remains a hot research topic (e.g., concurrent composition of reactive systems). In this paper, we aim at providing a logical framework in which composition issues can be reasoned about independently from the kind of systems and the laws of composition under consideration. We show that many composition related statements can be expressed in terms of predicate transformers in a way that presents interesting similarities with program semantics descriptions based on weakest precondition calculus. MotivationSystem designers, whether those systems are software, hardware, planes or buildings, are all faced with a common issue: How to compose systems from components and how to partition systems into components. Compositional design offers the hope of managing complexity by avoiding unnecessary details: Systems designers prove properties of systems given properties, but not detailed implementations, of components.As fundamental as it is, the question of composition is far from being solved in a fully satisfactory way. What does it mean for a formal framework to be "compositional "? Are there "good " and "bad " compositional frameworks? What characterizes "good " compositional specifications? Should system designers and components providers use the same kind of specifications? Are there fundamental laws of composition that are common to most areas of engineering? How are composition and reuse issues related? We believe these to be important questions one must (at least partially) answer before suitable solutions to the composition problem are found.In this paper, we aim at providing a basis that can be used to reason about composition. We seek a logical framework in which many of the questions mentioned above can be formulated and reasoned about. We try to keep the context of our approach as general as possible. Especially, we don't want to decide from

show abstract

“…In another paper, Charpentier and Chandy [CC99] present two proofs involving universal properties in order to demonstrate this creative process.…”

Section: Case Studies Involving Universal Propertiesmentioning

confidence: 99%

Mechanizing compositional reasoning for concurrent systems: some lessons

Ehmety

Paulson

2005

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. The paper reports on experiences of mechanizing various proposals for compositional reasoning in concurrent systems. The work uses the UNITY formalism and the Isabelle proof tool. The proposals investigated include existential/universal properties, guarantees properties and progress sets. The results also apply to related proposals such as traditional assumption-commitment guarantees and Misra's closure properties. Findings that have been published in detail elsewhere are summarised and consolidated here. One conclusion is that UNITY and related formalisms leave some important issues implicit, such as their concept of the program state, which means that great care must be exercised when implementing tool support. Another conclusion is that many compositional reasoning methods can be mechanized, provided that the issues mentioned above are correctly addressed.

show abstract

Examples of program composition illustrating the use of universal properties

Cited by 11 publications

References 8 publications

Specification transformers: a predicate transformer approach to composition

Specification transformers: a predicate transformer approach to composition

An Approach to Composition Motivated by wp

Mechanizing compositional reasoning for concurrent systems: some lessons

Contact Info

Product

Resources

About