A modular proof of correctness for a network synchronizer-Reference-Cited by-同舟云学术

A modular proof of correctness for a network synchronizer

Published:1988 Issue: Volume: Page:219-256
ISSN:0302-9743
Container-title:Distributed Algorithms
language:
Short-container-title:

Author:

Fekete A.,Lynch N.,Shrira L.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0019807

Reference11 articles.

1. Awerbuch, B., ‘Complexity of Network Synchronization,’ JACM, 32, 4, 804–823 (1985).

2. Awerbuch, B., ‘Reducing Complexities of Distributed Maximum Flow and Breadth-First Search Algorithms by means of Network Synchronization,’ Networks, 15, 425–437 (1985).

3. Fekete, A., Lynch, N., Merritt, M., and Weihl, W., ‘Nested Transactions and Read/Write Locking,’ Proceedings of 6th ACM Symposium on Principles of Database Systems, 1987.

4. Goldman, K., and Lynch, N., ‘Nested Transactions and Quorum Consensus,’ Proceedings of 6th ACM Symposium on Principles of Distributed Computation, 1987.

5. Herlihy, M., Lynch, N., Merritt, M., and Weihl, W., ‘Correctness of Orphan Elimination Algorithms,’ Proceedings of 17th IEEE Symposium on Fault-Tolerant Computing, 1987.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Simulating Synchrony on Top of Asynchronous Systems;Distributed Algorithms for Message-Passing Systems;2013

2. The use of a synchronizer yields the maximum computation rate in distributed networks;Theory of Computing Systems;1997-10

3. Highly concurrent logically synchronous multicast;Distributed Computing;1991-12

4. Foundations of compositional program refinement;Lecture Notes in Computer Science;1990

5. Highly concurrent logically synchronous multicast;Distributed Algorithms;1989