Charpentier, Michel and Chandy, K. Mani (2000) Theorems about Composition. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:2000.cs-tr-00-02
|
Postscript
See Usage Policy. 228Kb | |
|
Other (Adobe PDF (232KB))
See Usage Policy. 226Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:2000.cs-tr-00-02
Abstract
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: | Report or Paper (Technical Report) |
|---|---|
| Group: | Computer Science Technical Reports |
| Record Number: | CaltechCSTR:2000.cs-tr-00-02 |
| Persistent URL: | http://resolver.caltech.edu/CaltechCSTR:2000.cs-tr-00-02 |
| Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. |
| ID Code: | 26823 |
| Collection: | CaltechCSTR |
| Deposited By: | Imported from CaltechCSTR |
| Deposited On: | 25 Apr 2001 |
| Last Modified: | 26 Dec 2012 14:06 |
Repository Staff Only: item control page


