Information Processing Letters
Recovery in distributed systems using asynchronous message logging and checkpointing
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Efficient detection of channel predicates in distributed systems
Journal of Parallel and Distributed Computing
Debugging distributed programs using controlled re-execution
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Programmers use slices when debugging
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Detection of Weak Unstable Predicates in Distributed Programs
IEEE Transactions on Parallel and Distributed Systems
Distributed Slicing and Partial Re-execution for Distributed Programs
Proceedings of the 5th International Workshop on Languages and Compilers for Parallel Computing
Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution
Proceedings of the 13th International Symposium on Distributed Computing
Detection of global predicates: techniques and their limitations
Distributed Computing
Detecting Temporal Logic Predicates on the Happened-Before Model
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Computation Slicing: Techniques and Theory
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Algorithmic Combinatorics Based on Slicing Posets
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Software Fault Tolerance of Distributed Programs Using Computation Slicing
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
ACM SIGACT News distributed computing column 12
ACM SIGACT News
Granularity-Driven Dynamic Predicate Slicing Algorithms for Message Passing Systems
Automated Software Engineering
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Intractability results in predicate detection
Information Processing Letters
Techniques and applications of computation slicing
Distributed Computing
Algorithmic combinatorics based on slicing posets
Theoretical Computer Science
Distributed dynamic slicing of Java programs
Journal of Systems and Software
Formal Verification of Simulation Traces Using Computation Slicing
IEEE Transactions on Computers
Communication analysis of distributed programs
Scientific Programming - Parallel/High-Performance Object-Oriented Scientific Computing (POOSC '05), Glasgow, UK, 25 July 2005
Testing Distributed Systems Through Symbolic Model Checking
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Producing Short Counterexamples Using "Crucial Events"
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
On Detecting Regular Predicates in Distributed Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Intractability results in predicate detection
Information Processing Letters
Detection of disjunctive normal form predicate in distributed systems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Modeling and analyzing periodic distributed computations
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
FM'06 Proceedings of the 14th international conference on Formal Methods
Modeling, analyzing and slicing periodic distributed computations
Information and Computation
Hi-index | 0.00 |
Abstract: We introduce the notion of a slice of a distributed computation. A slice of a distributed computation with respect to a global predicate is a computation which captures those and only those consistent cuts of the original computation which satisfy the global predicate. We show that a slice exists for a global predicate iff the predicate is a regular predicate. We then give an efficient algorithm for computing the slice and show applications of slicing to testing and debugging of distributed programs.