On distributed verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4308 LNCS, Issue , 2006, Pages 100-114

  Korman, Amos ^a   Kutten, Shay ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC METHODS; INDIAN INSTITUTE OF TECHNOLOGIES; INVITED TALK; LOWER BOUNDS; POTENTIAL IMPACTS; PROBLEMS AND SOLUTIONS; SEQUENTIAL COMPUTING;

COMPUTATIONAL COMPLEXITY; MOTIVATION; SEPARATION;

SURVEYS;

EID: 79959867533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11947950_12     Document Type: Conference Paper

References (44)

1. A Comprehensive Bibliography on Self-Stabilization. A Working Paper in the CJTCS, http://cjtcs.cs.uchicago.edu/.
2. Y. Afek and G. M. Brown. Self-stabilization over unreliable communication media. Distributed Computing Journal, 7:27-34, 1993.
3. S. Aggarwal. Time optimal self-stabilizing spanning tree algorithms. M.Sc Thesis, MIT, May 1994.
4. A. Arora and M. Gouda. Distributed reset. In Proc. of the 10-th FSTTCS: Springer-Verlag LNCS 472, pp. 316-331, September 1990.
5. B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, and G. Varghese. Time optimal self stabilizing synchronization. In Proc. 25th STOC, pp. 652-661, May 1993.
6. B. Awerbuch and R. Ostrovsky. Memory efficient and self stabilizing network reset. In PODC, August 1994.
7. B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local checking and correction. In Proc. of the 32nd IEEE FOCS, pp. 268-277, October 1991.
8. B. Awerbuch, B. Patt-Shamir, G. Varghese, and S. Dolev. Self stabilization by local checking and global reset. in the Proc. of WDAG 94, Springer-Verlag LNCS, pp. 226-239, October 1994.
9. B. Awerbuch, and G. Varghese. Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In 32nd IEEE FOCS, pp. 258-267, October 1991.
10. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. CACM, 17:643-644, November 1974.
11. K. Mani Chandy, Leslie Lamport. Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. Comput. Syst. 3(1): 63-75 (1985).
12. E.W. Dijkstra. A belated proof of self-stabilization. Distributed Computing, 1(1):5-6, 1986.
13. S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing Journal, 7, 1994.
14. S. Dolev, A. Israeli, and S. Moran. Uniform dynamic self-stabilizing leader election. IEEE Trans. Parallel Distrib. Syst. 8(4): 424-440 (1997).
15. G. Itkis, and L Levin. Fast and Lean Self-Stabilizing Asynchronous Protocols. In Proc. of the 35th IEEE FOCS, pp. 226-239, October 1994.
16. S. Katz and K. J. Perry. Self-stabilizing extensions. Distributed Computing, 7, 1994.
17. L. Lamport. Solved problems, unsolved problems and nonproblems in concurrency. Proceedings of the 3rd PODC, pp. 1-11 August 1984.
18. Leslie Lamport: Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21(7): 558-565 (1978).
19. A. Mayer, R. Ostrovsky, and M. Yung. Self-stabilizing algorithms for synchronous unidirectional rings. In Proc. 7th SODA, Jan. 1996.
20. A. Mayer, Y. Ofek, R. Ostrovsky, and M. Yung. Self-stabilizing symmetry breaking in constant space. In Proc. 24th STOC, pages 667-678, May 1992.
21. G. Parlati and M. Yung. Non-exploratory self stabilization for constant-space symmetry-breaking In Proc. 2d ESA'94, pages 183-201. LNCS 855 Springer Verlag.
22. M. Naor and L. Stockmeyer. What can be computed locally. In Proc. 25th STOC, pp. 185-193. ACM, May 1993.
23. Schieber and Snir. Calling names on nameless networks. Information and Computation (formerly Information and Control), 113, 1994.
24. also in: Proc. of PODC 1989, pp. 319-328, August 1989.
25. A. Segall. Distributed network protocols. IEEE Trans. on Information Theory, IT-29(1):23-35, January 1983.
26. J. Spinelli and R. G. Gallager. Broadcast topology information in computer networks. IEEE Trans. on Comm., 1989.
27. G. Varghese. Dealing with Failure in Distributed Systems. PhD thesis, MIT, 1992.
28. G.M. Jayaram and Varghese. Crash failures can drive protocols to arbitrary states. PODC 1996, pp. 247-256.
29. M. Jayaram, G. Varghese. The Complexity of Crash Failures. PODC 1997, pp. 179-188.
30. M. Naor and L. Stockmeyer. What can be computed locally? Proc. 25th STOC, pp. 184-193, 1993.
31. R.G. Gallager, P.A. Humblet, P.M. Spira. A distributed algorithm for minimum-weight spanning trees. TOPLAS 5 (1983) 66-77.
32. 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).
33. S. Dolev, M. Gouda, and M. Schneider. Requirements for silent stabilization. Acta Informatica, 36(6): 447-462, 1999.
34. Beauquier, J., Delaet, S., Dolev, S., and Tixeuil, S., "Transient Fault Detectors". Proc. of the 12th DISC, Springer-Verlag LNCS:1499, pp. 62-74, 1998.
35. B. Dixon, M. Rauch, and R. E. Tarjan. Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM Journal on Computing, Vol. 21, No 6, pp. 1184-1192, December 1992.
36. M.L. Fredman and D.E. Willard. Trans-Dichotomous algorithms for minimum spanning trees and shortest paths. Proc. 31st IEEE FOCS, Los Alamitos, CA, 1990, pp. 719-725.
37. M. Garey and D. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, 1979.
38. D. R. Karger, P.N. Klein, and R.E. Tarjan. A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. JACM Vol. 42, No. 2, pp. 3210328, 1955.
39. Amos Korman and Shay Kutten. "Distributed Verification of Minimum Spanning Trees". in Proc. 25th PODC 2006, July 23-26 2006, Denver, Colorado, USA.
40. M. Katz, N.A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. In 19th SODA, Jan. 2002.
41. Amos Korman, Shay Kutten, and David Peleg. "Proof Labeling Schemes". Proceedings of the 24th PODC 2005, Las Vegas, NV, USA, July 2005.
42. Nathan Linial. Distributive Graph Algorithms-Global Solutions from Local Data. FOCS 1987: 331-335.
43. Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer. What cannot be computed locally! PODC 2004: 300-309.
44. Andrew C. Yao. Some Complexity Questions Related to Distributed Computing. STOC 1979, 209-213.