A Caltech Library Service

Theorems about Composition

Charpentier, Michel and Chandy, K. Mani (2000) Theorems about Composition. In: Mathematics of Program Construction. Lecture Notes in Computer Science. No.1837. Springer , Berlin, Heidelberg, pp. 167-186. ISBN 978-3-540-67727-7.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


Compositional designs require component specifications that can be composed: Designers have to be able to deduce system properties from components specifications. On the other hand, components specifications should be abstract enough to allow component reuse and to hide substantial parts of correctness proofs in components verifications. Part of the problem is that too abstract specifications do not contain enough information to be composed. Therefore, the right balance between abstraction and composability must be found. This paper explores the systematic construction of abstract specifications that can be composed through specific forms of composition called existential and universal.

Item Type:Book Section
Related URLs:
URLURL TypeDescription ItemTechnical Report ReadCube access
Additional Information:© 2000 Springer-Verlag Berlin Heidelberg.
Subject Keywords:Composition Operator; Invariant Property; System Property; Predicate Calculus; Universal Property
Series Name:Lecture Notes in Computer Science
Issue or Number:1837
Record Number:CaltechAUTHORS:20191008-135116482
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:99158
Deposited By: Tony Diaz
Deposited On:08 Oct 2019 20:57
Last Modified:16 Nov 2021 17:44

Repository Staff Only: item control page