Skip to main content
SpringerLink
Log in

On Distributed Verification

  • Conference paper
Distributed Computing and Networking (ICDCN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4308))

Included in the following conference series:

Abstract

This paper describes the invited talk given at the 8th International Conference on Distributed Computing and Networking (ICDCN 2006), at the Indian Institute of Technology Guwahati, India. This talk was intended to give a partial survey and to motivate further studies of distributed verification. To serve the purpose of motivating, we allow ourselves to speculate freely on the potential impact of such research.

In the context of sequential computing, it is common to assume that the task of verifying a property of an object may be much easier than computing it (consider, for example, solving an NP-Complete problem versus verifying a witness). Extrapolating from the impact the separation of these two notions (computing and verifying) had in the context of sequential computing, the separation may prove to have a profound impact on the field of distributed computing as well. In addition, in the context of distributed computing, the motivation for the separation seems even stronger than in the centralized sequential case.

In this paper we explain some motivations for specific definitions, survey some very related notions and their motivations in the literature, survey some examples for problems and solutions, and mention some additional general results such as general algorithmic methods and general lower bounds. Since this paper is mostly intended to “give a taste” rather than be a comprehensive survey, we apologize to authors of additional related papers that we did not mention or detailed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A Comprehensive Bibliography on Self-Stabilization. A Working Paper in the CJTCS, http://cjtcs.cs.uchicago.edu/

  2. Afek, Y., Brown, G.M.: Self-stabilization over unreliable communication media. Distributed Computing Journal 7, 27–34 (1993)

    Article  Google Scholar 

  3. Aggarwal, S.: Time optimal self- stabilizing spanning tree algorithms. M.Sc Thesis. MIT, Cambridge (May 1994)

    Google Scholar 

  4. Arora, A., Gouda, M.: Distributed reset. In: Veni Madhavan, C.E., Nori, K.V. (eds.) FSTTCS 1990. LNCS, vol. 472, pp. 316–331. Springer, Heidelberg (1990)

    Google Scholar 

  5. Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self stabilizing synchronization. In: Proc. 25th STOC, May 1993, pp. 652–661 (1993)

    Google Scholar 

  6. Awerbuch, B., Ostrovsky, R.: Memory efficient and self stabilizing network reset. In: PODC (August 1994)

    Google Scholar 

  7. Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction. In: Proc. of the 32nd IEEE FOCS, pp. 268–277 (October 1991)

    Google Scholar 

  8. Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S.: Self stabilization by local checking and global reset. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 226–239. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  9. Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: 32nd IEEE FOCS, pp. 258–267 (October 1991)

    Google Scholar 

  10. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. CACM 17, 643–644 (1974)

    MATH  Google Scholar 

  11. Chandy, K.M., Lamport, L.: Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. Comput. Syst. 3(1), 63–75 (1985)

    Article  Google Scholar 

  12. Dijkstra, E.W.: A belated proof of self-stabilization. Distributed Computing 1(1), 5–6 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  13. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distributed Computing Journal 7 (1994)

    Google Scholar 

  14. Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Trans. Parallel Distrib. Syst. 8(4), 424–440 (1997)

    Article  Google Scholar 

  15. Itkis, G., Levin, L.: Fast and Lean Self-Stabilizing Asynchronous Protocols. In: Proc. of the 35th IEEE FOCS, pp. 226–239 (October 1994)

    Google Scholar 

  16. Katz, S., Perry, K.J.: Self-stabilizing extensions. Distributed Computing 7 (1994)

    Google Scholar 

  17. Lamport, L.: Solved problems, unsolved problems and nonproblems in concurrency. In: Proceedings of the 3rd PODC, pp. 1–11 (August 1984)

    Google Scholar 

  18. Lamport, L. (ed.): Time, Clocks, and the Ordering of Events in a Distributed System. Commun., vol. 21(7), pp. 558–565. ACM, New York (1978)

    Google Scholar 

  19. Mayer, A., Ostrovsky, R., Yung, M.: Self-stabilizing algorithms for synchronous unidirectional rings. In: Proc. 7th SODA (January 1996)

    Google Scholar 

  20. Mayer, A., Ofek, Y., Ostrovsky, R., Yung, M.: Self-stabilizing symmetry breaking in constant space. In: Proc. 24th STOC, May 1992, pp. 667–678 (1992)

    Google Scholar 

  21. Parlati, G., Yung, M.: Non-exploratory self stabilization for constant-space symmetry-breaking. In: Proc. 2nd ESA 1994, vol. 855, pp. 183–201. Springer Verlag, Heidelberg (1994)

    Google Scholar 

  22. Naor, M., Stockmeyer, L.: What can be computed locally. In: Proc. 25th STOC, pp. 185–193. ACM, New York (1993)

    Google Scholar 

  23. Schieber, Snir: Calling names on nameless networks. Information and Computation (formerly Information and Control) 113, 319–328 (1994); Also in: Proc. of PODC 1989, pp. 319–328 (August 1989)

    MathSciNet  Google Scholar 

  24. Segall, A.: Distributed network protocols. IEEE Trans. on Information Theory 29(1), 23–35 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  25. Spinelli, J., Gallager, R.G.: Broadcast topology information in computer networks. IEEE Trans. on Comm. (1989)

    Google Scholar 

  26. Varghese, G.: Dealing with Failure in Distributed Systems. PhD thesis. MIT, Cambridge (1992)

    Google Scholar 

  27. Jayaram, M., Varghese, G.: Crash failures can drive protocols to arbitrary states. In: PODC 1996, pp. 247–256 (1996)

    Google Scholar 

  28. Jayaram, M., Varghese, G.: The Complexity of Crash Failures. In: PODC, pp. 179–188 (1997)

    Google Scholar 

  29. Naor, M., Stockmeyer, L.: What can be computed locally? In: Proc. 25th STOC, pp. 184–193 (1993)

    Google Scholar 

  30. Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimumweight spanning trees. TOPLAS 5, 66–77 (1983)

    Article  MATH  Google Scholar 

  31. Afek, Y., Kutten, S., Yung, M.: The Local Detection Paradigm and Its Application to Self-Stabilization. Theor. Comput. Sci. 186(1-2), 199–229 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  32. Dolev, S., Gouda, M., Schneider, M.: Requirements for silent stabilization. Acta Informatica 36(6), 447–462 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  33. Beauquier, J., Delaet, S., Dolev, S., Tixeuil, S.: Transient fault detectors. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 62–74. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  34. Dixon, M.: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM Journal on Computing 21(6), 1184–1192 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  35. Fredman, M.L., Willard, D.E.: Trans-Dichotomous algorithms for minimum spanning trees and shortest paths. In: Proc. 31st IEEE FOCS, pp. 719–725. Los Alamitos, CA (1990)

    Google Scholar 

  36. Garey, M., Johnson, D.: Computers and Intractability. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  37. Karger, R.D., Klein, P.N., Tarjan, R.E.: A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. JACM 42(2), 321–328 (1955)

    Article  MathSciNet  Google Scholar 

  38. Korman, A., Kutten, S.: Distributed Verification of Minimum Spanning Trees. In: Proc. 25th PODC 2006, pp. 23–26. Denver, Colorado, USA (July 2006)

    Google Scholar 

  39. Katz, M., Katz, N.A., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. In: 19th SODA (January 2002)

    Google Scholar 

  40. Korman, A., Kutten, S., Peleg, D.: Proof Labeling Schemes. In: Proceedings of the 24th PODC 2005, Las Vegas, NV, USA (July 2005)

    Google Scholar 

  41. Linial, N.: Distributive Graph Algorithms-Global Solutions from Local Data. In: FOCS 1987, pp. 331–335 (1987)

    Google Scholar 

  42. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: PODC 2004, pp. 300–309 (2004)

    Google Scholar 

  43. Yao, A.C.: Some Complexity Questions Related to Distributed Computing. In: STOC, pp. 209-213 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of IE&M, Technion, Haifa, 32000, Israel

    Amos Korman & Shay Kutten

Authors
  1. Amos Korman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shay Kutten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Iowa State University, 230 Atanasoff Hall, 50011, Ames, IA, USA

    Soma Chaudhuri

  2. Computer Science Department SUNY at Stony Brook Stony Brook, 11794-4400, NY, USA

    Samir R. Das

  3. Department of Computer Science & Engineering, Indian Institute of Technology, 781039, Guwahati, India

    Himadri S. Paul

  4. Dept. of Electrical and Computer Engineering, Iowa State University, 50010, Ames, IA, USA

    Srikanta Tirthapura

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korman, A., Kutten, S. (2006). On Distributed Verification. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_12

Download citation

  • DOI: https://doi.org/10.1007/11947950_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68139-7

  • Online ISBN: 978-3-540-68140-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation