Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Techniques to Tackle State Explosion in Global Predicate Detection
IEEE Transactions on Software Engineering
Elements of distributed computing
Elements of distributed computing
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Faster Possibility Detection by Combining Two Approaches
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Computation Slicing: Techniques and Theory
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Detecting Global Predicates in Distributed Computations
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
On Slicing a Distributed Computation
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Techniques for analyzing distributed computations
Techniques for analyzing distributed computations
ACM SIGACT News distributed computing column 12
ACM SIGACT News
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Techniques and applications of computation slicing
Distributed Computing
Formal Verification of Simulation Traces Using Computation Slicing
IEEE Transactions on Computers
| Hi-index | 0.00 |
Writing correct distributed programs is hard. In spite ofextensive testing and debugging, software faults persist evenin commercial grade software. Many distributed systems,especially those employed in safety-critical environments,should be able to operate properly even in the presence ofsoftware faults. Monitoring the execution of a distributedsystem, and, on detecting a fault, initiating the appropriatecorrective action is an important way to tolerate such faults.This gives rise to the predicate detection problem which involvesfinding a consistent cut of a distributed computation,if it exists, that satisfies the given global predicate.Detecting a predicate in a computation is, however, anNP-complete problem. To ameliorate the associated combinatorialexplosion problem, we introduce the notion of computationslice in our earlier papers [5, 10]. Intuitively, sliceis a concise representation of those consistent cuts that satisfya certain condition. To detect a predicate, rather thansearching the state-space of the computation, it is muchmore efficient to search the state-space of the slice. Inthis paper, we provide efficient algorithms to compute theslice for several classes of predicates. Our experimentalresults demonstrate that slicing can lead to an exponentialimprovement over existing techniques in terms of time andspace.