Michel Charpentier, K. Mani Chandy  Home/Search
Context Related
| unh.edu/~charpov/Publis/...cc00.2.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unh.edu/~charpov/Publis/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Compositional designs require component specifications that can be composed: Designers have to be able to deduce system properties from components speci cations. 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... (Update)
Similar documents based on text: More All
0.5: An Approach to Composition Motivated by wp - Charpentier (2002) (Correct)
0.4: Composing Invariants - Charpentier (2003) (Correct)
0.4: Reasoning about Composition: A Predicate Transformer Approach - Charpentier (2001) (Correct)
BibTeX entry: (Update)
Michel Charpentier and K. Mani Chandy. Theorems about composition. In R. Backhouse and J. Nuno Oliveira, editors, Mathematics of Program Construction: Fifth International Conference, LNCS 1837, pages 167--186. Springer, 2000. http://citeseer.ist.psu.edu/charpentier00theorems.html More
@inproceedings{ charpentier00theorems,
author = "Michel Charpentier and K. Mani Chandy",
title = "Theorems about Composition",
booktitle = "Mathematics of Program Construction",
pages = "167--186",
year = "2000",
url = "citeseer.ist.psu.edu/charpentier00theorems.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
78 Texts and monographs in computer science (context) - Dijkstra, Scholten et al. - 1990
51 Eliminating the substitution axiom from Unity logic (context) - Sanders - 1991
50 ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1993
50 ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1995
36 A logic for concurrent programming: Safety (context) - Misra - 1995
24 Design of Compositional Proof Systems Based on AssumptionCom.. (context) - Collette - 1994
15 Verifying for reuse: foundations of object-oriented system v.. - Fiadeiro, Maibaum - 1995
14 Reasoning about program composition - Chandy, Sanders
13 Examples of program composition illustrating the use of univ.. - Charpentier, Chandy - 1999
10 Program Renement in Unity-like Environments (context) - Udink - 1995
9 An abstract account of composition (context) - Abadi, Merz - 1995
7 California Institute of Technology (context) - Sivilotti, for et al. - 1997
6 Composition of assumption-commitment specications in a Unity.. (context) - Collette - 1994
6 Institut National Polytechnique de Toulouse (context) - Charpentier, la et al. - 1997
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.unh.edu/~charpov/Publis/): More
A UNITY Mapping Operator for Distributed Programs - Charpentier (1997) (Correct)
A UNITY-based Algorithm Design Assistant - Charpentier, Hadri, Padiou (1995) (Correct)
Abstracting Communication to Reason about Distributed Algorithms - Charpentier (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC