Distributed termination detection algorithm for distributed computations
Information Processing Letters
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
An efficient distributed depth-first-search algorithm
Information Processing Letters
Modern operating systems
A counter-example to an algorithm for the generalized input-output construct of CSP
Information Processing Letters
An Effective Implementation for the Generalized Input-Output Construct of CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
On the Correctness of a Termination Detection Algorithm
On the Correctness of a Termination Detection Algorithm
Locking and Deadlock Detection in Distributed Data Bases
IEEE Transactions on Software Engineering
On Deadlock Detection in Distributed Systems
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
In past years, a large number of published distributed algorithms have been shown to be incorrect. Unfortunately, designers of distributed algorithms typically use informal correctness proofs, which tend to be unreliable. Formal correctness proofs offer a much higher degree of reliability, but they are not popular among algorithm designers because they are too mathematical and they typically assume synchronous message communication or some other abstract notation, and are therefore not easily applicable to the asynchronous message passing environment --- the environment commonly assumed by many algorithm designers. To address this problem, we have developed a semiformal correctness proof method for the asynchronous message passing environment, using ideas from well known formal correctness proof methods. In this paper, we illustrate part of the proof method by proving the safety property of a simple network broadcast algorithm.