Program composition in Isabelle/UNITY

Ehmety, Sidi O.; Paulson, Lawrence C.

doi:10.1109/ipdps.2002.1016620

Cited by 4 publications

(2 citation statements)

References 5 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

Specification transformers: a predicate transformer approach to composition

Charpentier

Chandy

2004

Acta Informatica

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%

Specification transformers: a predicate transformer approach to composition

Charpentier

Chandy

2004

Acta Informatica

View full text Add to dashboard Cite

show abstract

“…Remarkable formalizations for compositional approaches are [2,9] for the UNITY framework in Isabelle/HOL and the soundness proof of McMillan assume-guarantee rule [6] in PVS [12]. Surprisingly, there is not much work on embedding Hoare logics for parallelism in theorem provers.…”

Section: Related Workmentioning

confidence: 99%

The Rely-Guarantee Method in Isabelle/HOL

Nieto

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present the formalization of the rely-guarantee method in the theorem prover Isabelle/HOL. This method consists of a Hoarelike system of rules to verify concurrent imperative programs with shared variables in a compositional way. Syntax, semantics and proof rules are defined in higher-order logic. Soundness of the proof rules w.r.t. the semantics is proven mechanically. Also parameterized programs, where the number of parallel components is a parameter, are included in the programming language and thus can be verified directly in the system. We prove that the system is complete for parameterized programs. Finally, we show by an example how the formalization can be used for verifying concrete programs.

show abstract

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

Program composition in Isabelle/UNITY

Abstract: We

Cited by 4 publications

References 5 publications

Specification transformers: a predicate transformer approach to composition

Specification transformers: a predicate transformer approach to composition

The Rely-Guarantee Method in Isabelle/HOL

Mechanizing compositional reasoning for concurrent systems: some lessons

Contact Info

Product

Resources

About