(Enter summary)
Abstract: We present a theorem for deriving properties of a concurrent program by reasoning
about a simpler, coarser-grained version. The theorem generalizes a result that
Lipton proved for partial correctness and deadlock-freedom. Our theorem applies
to all safety properties.
v
Contents
1 Introduction 1
2 Lipton's Theorem 2
3 A General Reduction Theorem 5
3.1 Definitions : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5
3.1.1 Programs : : : : : : : : : : : : : : : : : : : : : : : : : : 5... (Update)
Context of citations to this paper: More
...we show how to change the processes when the rendezvous communication is replaced by asynchronous communication. Lamport and Schneider [LS89] have explored the theoretical foundations of comparing atomic transactions (e.g. rendezvous communication) and split transactions...
...we show how to change the processes when the rendezvous communication is replaced by asynchronous communication. Lamport and Schneider [12] have explored the theoretical foundations of comparing atomic transactions (e.g. rendezvous communication) and split transactions...
Cited by: More
Deriving Efficient Cache Coherence Protocols through.. - Nalumasu, Gopalakrishnan (1997)
(Correct)
Verification of Cache Coherence Protocols by Aggregation of.. - Park, Dill (1998)
(Correct)
Similar documents (at the sentence level):
49.6%: Pretending Atomicity - Lamport, Schneider (1989)
(Correct)
Active bibliography (related documents): More All
0.2: Reduction in TLA - Cohen, Lamport (1998)
(Correct)
0.1: Control Predicates are Better than Dummy Variables for Reasoning.. - Lamport (1986)
(Correct)
0.1: Reasoning about Programs by Exploiting The Environment - Fix, B.Schneider (1994)
(Correct)
Similar documents based on text: More All
0.4: Derivation of Sequential, Real-Time, . . . - Marzullo, Schneider, Budhiraja (1991)
(Correct)
0.2: Progress Measures for Verification Involving Nondeterminism - Klarlund, Schneider (1990)
(Correct)
0.2: Verifying Programs That Use - Causally-Ordered Message-Passing..
(Correct)
Related documents from co-citation: More All
8: Reduction: A method of proving properties of parallel programs (context) - Lipton - 1975
8: The Stanford FLASH Multiprocessor (context) - Kuskin - 1994
7: Protocol verification by aggregation of distributed transactions
- Park, Dill - 1996
BibTeX entry: (Update)
Leslie Lamport and Fred Schneider. Pretending atomicity. Technical Report 44, SRC Digital, 1989. http://citeseer.ist.psu.edu/article/lamport89pretending.html More
@techreport{ lamport89pretending,
author = "Leslie Lamport and Fred B. Schneider",
title = "Pretending Atomicity",
number = "TR89-1005",
pages = "29",
year = "1989",
url = "citeseer.ist.psu.edu/article/lamport89pretending.html" }
Citations (may not include all citations):
231
Information Processing Letters (context) - Alpern, Schneider - 1985
208
An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
157
Proving the correctness of multiprocess programs (context) - Lamport - 1977
65
Hoare logic (context) - Lamport, Schneider - 1984
65
Hoare logic (context) - Lamport - 1980
62
Reduction: A method of proving properties of parallel progra.. (context) - Lipton - 1975
40
Proving assertions about parallel programs (context) - Ashcroft - 1975
20
Parallel program correctness through refinement (context) - Doeppner - 1977
12
Constraints: A uniform approach to aliasing and typing
- Lamport, Schneider - 1985
6
Reports on Computer Science and Mathematics Ser (context) - Back, in - 1988
Documents on the same site (http://maui.theoinf.tu-ilmenau.de/forschung/links/leslie-lamport-tech_report.html): More
Control Predicates are Better than Dummy Variables for Reasoning.. - Lamport (1986)
(Correct)
The Existence of Refinement Mappings - Abadi, Lamport (1988)
(Correct)
A Simple Approach to Specifying Concurrent Systems - Lamport (1988)
(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