(Enter summary)
Abstract: This paper presents a theory for concurrent program composition
based on a predicate transformer call the the weakest guarantee and a
corresponding binary relation guarantees. The theory stems from a novel
view of rely-guarantee techniques for reasoning about program composition
and provides a general and uniform framework for handling temporal
properties as well as other kinds of program properties such as refinement
and encapsulation.
1 Introduction
The contribution of this paper is a... (Update)
Cited by: More
A Theory for Composing Distributed Components Based.. - Prasetya, Vos.. (2003)
(Correct)
Representing Component States in Higher-Order Logic - Ehmety, Paulson (2001)
(Correct)
Mechanizing Compositional Reasoning for Concurrent Systems.. - Ehmety, Paulson (2005)
(Correct)
Active bibliography (related documents): More All
0.7: Exploiting Historical Information about Computations - Beverly Sanders Mani (1996)
(Correct)
0.3: A Cottage Industry of Software Publishing: Implications.. - Chandy, Sivilotti.. (1998)
(Correct)
0.3: Towards a Compositional Approach to the Design and.. - Charpentier, Chandy (1999)
(Correct)
Similar documents based on text: More All
0.1: A Predicate Transformer for the Progress Property `to-Always' - Dijkstra, Sanders (1996)
(Correct)
0.1: Unifying WP and WLP - Morgan, McIver (1995)
(Correct)
0.1: A Rely-guarantee Discipline for Open Distributed Systems Design - Duarte, Maibaum (1999)
(Correct)
Related documents from co-citation: More All
8: Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
7: A logic for concurrent programming: Progress (context) - Misra - 1995
6: Examples of program composition illustrating the use of universal properties
- Charpentier, Chandy - 1999
BibTeX entry: (Update)
Chandy, K. M. and Sanders, B. A. 1998. Reasoning about program composition. preprint. http://citeseer.ist.psu.edu/chandy96reasoning.html More
@misc{ chandy98reasoning,
author = "K. Chandy and B. Sanders",
title = "Reasoning about program composition",
text = "Chandy, K. M. and Sanders, B. A. 1998. Reasoning about program composition.
preprint.",
year = "1998",
url = "citeseer.ist.psu.edu/chandy96reasoning.html" }
Citations (may not include all citations):
716
Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
650
An axiomatic basis for computer programming (context) - Hoare - 1969
625
ACM Transactions on Programming Languages and Systems (context) - Lamport, logic et al. - 1994
168
ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1995
168
ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1993
114
The temporal semantics of concurrent programs (context) - Pnueli - 1981
88
Part II: Parallel and reactive programs (context) - Back - 1989
64
The larch family of specification languages (context) - Guttag, Horning et al. - 1985
61
Tentative steps toward a development method for interfering .. (context) - Jones - 1983
60
ACM Transactions on Programming Languages and Systems (context) - Nelson, of et al. - 1989
51
Eliminating the substitution axiom from UNITY logic (context) - Sanders - 1991
47
Theoretical Computer Science (context) - Manna, Pnueli et al. - 1991
42
Part I: Sequential nondeterministic programs (context) - Back, von Wright - 1989
41
Predicate Calculus and Program Semantics (context) - Dijkstra, Scholten - 1990
41
Data refinement of predicate transformers (context) - Gardiner, Morgan - 1991
36
A logic for concurrent programming: Safety (context) - Misra - 1995
36
A proof technique for rely/guarantees properties
- Stark - 1985
35
win and sin: Predicate transformers for concurrency
- Lamport - 1990
35
A logic for concurrent programming: Progress (context) - Misra - 1995
17
A simple proof of a completeness result for leads-to in the .. (context) - Pachl - 1992
16
Predicate transformers for reasoning about concurrent comput.. (context) - Chandy, Sanders - 1995
14
Specifying modules to satisfy interfaces-- a state transitio.. (context) - Lam, Shankar - 1992
13
A predicate transformer approach to semantics of parallel pr.. (context) - Jutla, Knapp et al. - 1989
12
A theory of interfaces and modules 1: Composition theorem (context) - Lam, Shankar - 1994
9
Adding fair choice to Dijkstra's calculus (context) - Broy, Nelson - 1994
6
a notion of completeness for the leads-to (context) - Rao - 1991
5
Composition of assumption-commitment specifications in a UNI.. (context) - Collette - 1994
3
Composing processes using modified rely-guarantee specificat.. (context) - Manohar, Sivilotti - 1996
2
A predicate transformer for the progress property `to-always
- Dijkstra, Sanders - 1996
1
to appear (context) - Sanders, of et al. - 1996
1
Exploiting historical information about computations
- Sanders, Chandy - 1996
1
and Unbounded Choice: Predicate Transformer Semantics and Tr.. (context) - Hesselink, Recursion - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cise.ufl.edu/research/ParallelPatterns/PatternLanguage/Background/Bibliography.htm): More
The Mesh Archetype - Berna Massingill
(Correct)
A Pattern Language for Parallel Application Programming - Massingill, Mattson, Sanders (1999)
(Correct)
The Mesh-Spectral Archetype - Greg Davis And
(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