(Enter summary)
Abstract: Compositional reasoning about a system means writing its
specification as the parallel composition of components and reasoning
separately about each component. When distracting language issues are
removed and the underlying mathematics is revealed, compositional reasoning
is seen to be of little use. (Update)
Similar documents based on text: More All
1.0: Composition: A Way to Make Proofs Harder - Lamport (1997)
(Correct)
0.2: Deductive Modelchecking - Sipma (1999)
(Correct)
0.2: Multi-Agent - Van Eck
(Correct)
Related documents from co-citation: More All
7: ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1993
7: Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
7: Examples of program composition illustrating the use of universal properties
- Charpentier, Chandy - 1999
BibTeX entry: (Update)
@article{ lamport98composition,
author = "Leslie Lamport",
title = "Composition: {A} Way to Make Proofs Harder",
journal = "Lecture Notes in Computer Science",
volume = "1536",
pages = "402--423",
year = "1998",
url = "citeseer.ist.psu.edu/lamport97composition.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://research.microsoft.com/users/lamport/pubs/pubs.html#time-clocks): More
Lower Bounds on Consensus - Lamport (2000)
(Correct)
High-Level Specifications: Lessons from Industry - Batson, Lamport (2003)
(Correct)
Formal Specification of a Web Services Protocol - Johnson (2004)
(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