Hierarchical correctness proofs for distributed algorithms

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn Part F130235, Issue , 1987, Pages 137-151

  Lynch, Nancy A ^a   Tuttle, Mark R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CORRECTNESS PROOFS; DISTRIBUTED NETWORKS; INPUT-OUTPUT; MODEL OF COMPUTATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 85031892754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41840.41852     Document Type: Conference Paper

References (25)

1. Bowen Alpern and Fred B. Schneider. Proving boolean combinations of deterministic properties. In Proceedings of Second Annual Symposium on Logic in Computer Science, June 1987.
2. Howard Barringer, Ruurd Kuiper, and Amir Pnueli. Now you may compose temporal logic specifications. In Proceedings of the 16th Annual ACM Symposium on Theory of Computation, pages 51-63, April 1984.
3. Bard Bloom. Constructing two-writer atomic registers. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, August 1987.
4. Alan Fekete, Nancy Lynch, Michael Merritt, and William Weihl. Nested transactions and read/write locking. In Proceedings of the 6th Annual ACM Symposium on Principles of Database Systems, pages 97-111, March 1987.
5. Alan Fekete, Nancy Lynch, and Liuba Shrira. A modular proof of correctness for a network synchronizer. 1987. In progress.
6. Nissim Francez. Fairness. Springer-Verlag, Berlin, 1986.
7. Robert Gallagher, Pierre Humblet, and Phillip Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1):66-77, January 1983.
8. Kenneth Goldman and Nancy Lynch. Quorum consensus in nested transaction systems. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, August 1987. Also available as MIT Technical Report MIT/LCS/TR-390.
9. David Harel. Statecharts: a visual formalism for complex systems. 1987. To appear in Science of Computer Programming.
10. Maurice Herlihy, Nancy Lynch, Michael Merritt, and William Weihl. On the correctness of orphan elimination algorithms. In Proceedings of the 17th Annual IEEE Symposium on Fault-Tolerant Computing, July 1987.
11. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, New Jersey, 1985.
12. Leslie Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2): 190-222, April 1983.
13. Nancy Lynch and Michael Merritt. Introduction to the Theory of Nested Transactions. Technical Report MIT/LCS/TR-367, Laboratory for Computer Science, Massachusetts Institute of Technology, 1986.
14. Simon S. Lam and A. Udaya Shankar. Protocol verification via projections. IEEE Transactions on Software Engineering, SE-10(4):325-342, July 1984.
15. Leslie Lamport and Fred Schneider. The "Hoare logic" of CSP, and all that. ACM Transactions on Programming Languages and Systems, 6(2):281-296, April 1984.
16. Nancy A. Lynch and Mark R. Tuttle. Hierarchical Correctness Proofs for Distributed Algorithms, Technical Report MIT/LCS/TR-387, Laboratory for Computer Science, Massachusetts Institute of Technology, April 1987.
17. Nancy A. Lynch. Concurrency Control for Resilient Nested Transactions. Technical Report MIT/LCS/TR-285, Laboratory for Computer Science, Massachusetts Institute of Technology, February 1983.
18. Nancy Lynch. Unpublished notes, 1986.
19. Robin Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer-Verlag, Berlin, 1980.
20. Zohar Manna and Amir Pnueli. Verification of concurrent programs: temporal proof principles. In Dexter Kozen, editor, Logic of Programs, Lecture Notes in Computer Science 181, pages 200-252, Springer-Verlag, Berlin, 1981.
21. Zohar Manna and Amir Pnueli. Verification of concurrent programs: the temporal framework. In Robert S. Boy er and J. Strother Moore, editors, The Correctness Problem in Computer Science, pages 215-273, Academic Press, London, 1981.
22. Susan Owicki and David Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(4):319-340, August 1976.
23. Arnold Schonhage. Personal Communication, 1980.
24. Eugene W. Stark. Foundations of a Theory of Specification for Distributed Systems. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, August 1984. Available as Technical Report MIT/LCS/TR-342.
25. Jennifer L. Welch. Synthesis of efficient mutual exclusion algorithms. 1987. In progress.