A belated proof of self-stabilization
Distributed Computing
Calling names in nameless networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilizing symmetry breaking in constant-space (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Memory-efficient and self-stabilizing network RESET (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Crash failures can drive protocols to arbitrary states
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
The complexity of crash failures
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The local detection paradigm and its applications to self-stabilization
Theoretical Computer Science
Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Labeling schemes for flow and connectivity
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Self-Stabilization by Local Checking and Global Reset (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Distributed Reset (Extended Abstract)
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
1983 Invited address solved problems, unsolved problems and non-problems in concurrency
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributive graph algorithms Global solutions from local data
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Fast and lean self-stabilizing asynchronous protocols
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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.