Mark R. Tuttle  Home/Search
Context Related
Links: ACM DBLP | digital.com/who/people...thesisms.ps.gz Cached: 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.
PS.gz PS Image Update HelpFrom: digital.com/who/people/tutt...bib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton. This simple, powerful model captures in a novel way the game-theoretic interaction between a system and its environment, and allows fundamental properties of distributed computation such as fair computation to be naturally expressed. Furthermore, this model can be used to construct modular, hierarchical correctness proofs of distributed algorithms. This thesis defines the... (Update)
Cited by: More
Unknown - Implementing Coherent Memory (Correct)
Establishing Qualitative Properties for - Probabilistic Lossy Channel (Correct)
The Existence of Refinement Mappings - Mart'in Abadi And (1991) (Correct)
Similar documents (at the sentence level):
5.9%: Hierarchical Correctness Proofs for Distributed Algorithms - Lynch, Tuttle (1987) (Correct)
Active bibliography (related documents): More All
0.9: Ready Simulation, Bisimulation, and the Semantics of CCS-Like.. - Bloom (1993) (Correct)
0.5: Extending Statecharts with Temporal Logic - Sowmya, Ramesh (1994) (Correct)
0.4: Proving Entailment Between Conceptual State Specifications - Stark (1986) (Correct)
Similar documents based on text: More All
0.4: The Real-Time Cost of Timing Uncertainty Consensus and Failure.. - Ponzio (1991) (Correct)
0.3: Data Replication in Nested Transaction Systems - Goldman (1987) (Correct)
0.3: A Process Algebraic View of I/O Automata - Segala (1992) (Correct)
Related documents from co-citation: More All
26: Communicating Sequential Processes (context) - Hoare - 1985
22: ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
18: An introduction to input/output automata (context) - Lynch, Tuttle - 1988
BibTeX entry: (Update)
N. Lynch and M. Tuttle, "Hierarchical Correctness Proofs for Distributed Algorithms," in Proc. 6th ACM Symp. on Principles of Distributed Computing, pp. 137--151, 1987. http://citeseer.ist.psu.edu/tuttle87hierarchical.html More
@misc{ lynch87hierarchical,
author = "N. Lynch and M. Tuttle",
title = "Hierarchical Correctness Proofs for Distributed Algorithms",
text = "N. Lynch and M. Tuttle, Hierarchical Correctness Proofs for Distributed
Algorithms, in Proc. 6th ACM Symp. on Principles of Distributed Computing,
pp. 137--151, 1987.",
year = "1987",
url = "citeseer.ist.psu.edu/tuttle87hierarchical.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985 ACM DBLP
1174 Statecharts: A visual formalism for complex systems - Harel - 1987
650 An axiomatic basis for computer programming (context) - Hoare - 1969 ACM DBLP
539 The temporal logic of programs (context) - Pnueli - 1977 ACM DBLP
223 Assigning meanings to programs (context) - Floyd - 1967
204 Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
157 Proving the correctness of multiprocess programs (context) - Lamport - 1977 DBLP
142 Solution of a problem in concurrent programming control (context) - Dijkstra - 1965 ACM
120 ACM Transactions on Programming Languages and Systems (context) - Lamport, program - 1983
111 Springer-Verlag (context) - Francez - 1986
104 Proving liveness properties of concurrent programs (context) - Owicki, Lamport - 1982 ACM DBLP
71 Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
70 Verification of concurrent programs: The temporal framework (context) - Manna, Pnueli - 1981
68 Ten years of Hoare's logic: A survey -- part (context) - Apt - 1981
65 Hoare logic (context) - Lamport - 1980
65 Hoare logic (context) - Lamport, Schneider - 1984
48 Constructing two-writer atomic registers (context) - Bloom - 1987
45 IEEE Transactions on Software Engineering (context) - Lam, Shankar et al. - 1984
43 On describing the behavior and implementation of distributed.. - Lynch, Fischer - 1981 ACM DBLP
43 Verification of concurrent programs: Temporal proof principl.. (context) - Manna, Pnueli - 1981 DBLP
33 Adequate proof principles for invariance and liveness proper.. (context) - Manna, Pnueli - 1984 ACM DBLP
23 Foundations of a Theory of Specification for Distributed Sys.. - Stark - 1984 ACM
19 An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
18 Introduction to the theory of nested transactions - Lynch, Merritt - 1986 ACM DBLP
17 Proof rules for the programming language Euclid (context) - London, Guttag et al. - 1978 ACM DBLP
17 Concurrency control for resilient nested transactions (context) - Lynch - 1983 ACM DBLP
15 An exercise in proving parallel programs correct (context) - Gries - 1977 ACM DBLP
13 Further comments on Dijkstra's concurrent programming contro.. (context) - Eisenberg, McGuire - 1972 ACM DBLP
13 Using message passing for distributed programming: Proof rul.. - Schlichting, Schneider - 1984
13 Fairness Properties (context) - Parrow - 1985
11 Temporal logic specification of distributed systems (context) - Schwartz, Melliar-Smith - 1981
11 A distributed algorithm for minimum-weight spanning trees (context) - Gallagher, Humblet et al. - 1983 ACM DBLP
11 Proving safety and liveness of communicating processes with .. (context) - Misra, Chandy et al. - 1982 ACM DBLP
10 Verifying temporal properties without using temporal logic (context) - Alpern, Schneider - 1985 ACM
10 the correctness of orphan elimination algorithms (context) - Herlihy, Lynch et al. - 1987
9 Partial order semantics versus interleaving semantics for CS.. (context) - Reisig - 1984 ACM DBLP
8 Verifying network protocols using temporal logic (context) - Hailpern, Owicki - 1980 ACM
6 Quorum consensus in nested transaction systems - Goldman, Lynch - 1987
6 Ten years of Hoare's logic: A survey -- part II: Nondetermin.. (context) - Apt - 1984
6 A fair calculus of communicating systems (context) - Costa, Stirling - 1984 ACM DBLP
5 Department of Computer Science (context) - Alpern, Schneider et al. - 1986
3 A proof technique for communicating sequential processes (context) - Levin, Gries - 1981 DBLP
2 Unpublished notes (context) - Lynch - 1986
2 Personal Communication (context) - Schonhage - 1980
2 Fairness assumptions for CSP in a temporal logic framework (context) - Kuiper, de Roever - 1983
2 A model and temporal proof system for networks of processes (context) - David, Susan - 1985 ACM DBLP
2 Nested transactions and read/write locking (context) - Fekete, Lynch et al. - 1987 DBLP
2 A synthesis of efficient mutual exclusion algorithms (context) - Welch - 1987
1 Unpublished notes (context) - Bloom - 1986
1 A hierarchical proof of a distributed algorithm (context) - Lamport, Lynch et al. - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.crl.research.digital.com/who/people/tuttle/bib.htm): More
Hierarchical Correctness Proofs for Distributed Algorithms - Lynch, Tuttle (1987) (Correct)
A Knowledge-Based Analysis of Zero Knowledge - Halpern, Moses, Tuttle (1988) (Correct)
Fast Increment Registers - Chaudhuri, Tuttle (1994) (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