Proof labeling schemes

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 9-18

  Korman, Amos ^a   Kutten, Shay ^b   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distributed networks; Proof labels; Property verification; Self stabilization

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

DISTRIBUTED ALGORITHMS; PROOF LABELS; PROPERTY VERIFICATION; SELF STABILIZATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 32344444906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073817     Document Type: Conference Paper

References (22)

1. M. Naor and L. Stockmeyer. What can be computed locally? Proc. 25th ACM Symp. on Theory of Computing, pages 184-193, 1993.
2. D. Peleg. Distributed Comuting: A Locality-Sensitive Approach. SIAM, 2000.
3. M. Wattenhofer and R. Wattenhofer. Distributed Weighted Matching. Proc. DISC, pages 335-348, 2004.
4. A. Arora and M. Gouda. Distributed reset (extended abstract) Proc. 10th Conf on Foundations of Software Technology and Theoretical Computer Science, 316-331, November 1990, Bangalore, India.
5. S. Aggarwal and S. Kutten. Time Optimal Self-Stabilizing Spanning Tree Algorithms. Proc. 15th Conf on Foundations of Software Technology and Theoretical Computer Science, 1993, 400-410.
6. B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, and G. Varghese. Time optimal self-stabilizing synchronization. Proc. STOC 1993, 652-661.
7. Y. Afek and S. Dolev. Local Stabilizer. J. Parallel Distrib. Comput. 62(5)s. 745-765 (2002).
8. Y. Afek, S. Kutten, and M. Yung. The Local Detection Paradigm and Its Application to Self-Stabilization. Theor. Comput. Sci. 186(1-2): 199-229 (1997).
9. B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-Stabilization By Local Checking and Correction. Proc. FOCS 1991, 268-277.
10. B. Awerbuch, B. Patt-Shamir, G. Varghese, and S. Dolev. Self-Stabilization by Local Checking and Global Reset. Proc. WDAG, 1994, 326-339.
11. Baruch Awerbuch, George Varghese. Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols. In Proc. FOCS, 1991, 258-267.
12. S. Dolev, M. Gouda, and M. Schneider. Requirements for silent stabilization. Acta Informatica, 36(6): 447-462, 1999.
13. Beauquier, J., Delaet, S., Dolev, S., and Tixeuil, S., "Transient Fault Detectors". Proc. of the 12th International Symposium on Distributed Computing, Springer-Verlag LNCS:1499, pp. 62-74, 1998.
14. D. Angluin. Local and global properties in networks of processes. In Proc. 12th ACM Symp. on Theory of Computing, 82-93, May 1980.
15. Edsger W. Dijkstra. Self-stabilizing systems in spite of distributed control. Comm. ACM, 17(11):643-644, November 1974.
16. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing Journal, 7,1, 3-16, 1993.
17. S. Dolev, A. Israeli, and S. Moran. Uniform dynamic self-stabilizing leader election. IEEE Trans. Parallel Distrib. Syst. 8(4): 424-440 (1997).
18. M. Garey and D. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, 1979.
19. Nathan Linial. Distributive Graph Algorithms-Global Solutions from Local Data. FOCS 1987: 331-335.
20. Z. Manna and A. Pnueli. Models for reactivity. Acta Informatica, 3:609-678, 1993.
21. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer. What cannot be computed locally! PODC 2004: 300-309.
22. Andrew C. Yao. Some Complexity Questions Related to Distributed Computing. Proc. of the 11th ACM Symposium on Theory of Computing (STOC), 1979, 209-213.