Computation slicing: Techniques and theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2180, Issue , 2001, Pages 78-92

  Mittal, Neeraj ^a   Garg, Vijay K ^b  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; DISTRIBUTED COMPUTER SYSTEMS;

COMPUTATION SLICING; CONSISTENT GLOBAL CHECKPOINT; DISTRIBUTED COMPUTATIONS; DISTRIBUTED PROGRAM; GLOBAL PROPERTY EVALUATION; NP COMPLETE; OPTIMAL ALGORITHM;

COMPUTATION THEORY;

EID: 33749390924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_6     Document Type: Conference Paper

References (19)

1. K. M. Chandy and L. Lamport. DistributedSnapshots: Determining Global States of DistributedSystems. ACM Transactions on Computer Systems, 3(1):63–75, February 1985
2. C. Chase and V. K. Garg. Detection of Global Predicates: Techniques andtheir Limitations. Distributed Computing, 11(4):191–201, 1998.
3. R. Cooper and K. Marzullo. Consistent Detection of Global Predicates. In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, pages 163–173, Santa Cruz, California, 1991.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1990.
5. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, Cambridge, UK, 1990.
6. V. K. Garg and N. Mittal. On Slicing a DistributedComputation. In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems (ICDCS), pages 322–329, Phoenix, Arizona, April 2001.
7. V. K. Garg and B. Waldecker. Detection of Unstable Predicates. In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, Santa Cruz, California, May 1991.
8. B. Korel and R. Ferguson. Dynamic Slicing of DistributedPrograms. Applied Mathematics and Computer Science Journal, 2(2):199–215, 1992.
9. B. Korel and J. Rilling. Application of Dynamic Slicing in Program Debugging. In Mariam Kamkar, editor, Proceedings of the 3rd International Workshop on Automated Debugging (AADEBUG), pages 43–57, Linköping, Sweden, May 1997.
10. L. Lamport. Time, Clocks, andthe Ordering of Events in a Distributed System. Communications of the ACM (CACM), 21(7):558–565, July 1978.
11. N. Mittal and V. K. Garg. Debugging DistributedPrograms Using Controlled Reexecution. In Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC), pages 239–248, Portland, Oregon, July 2000.
12. N. Mittal and V. K. Garg. Computation Slicing: Techniques and Theory. Technical Report TR-PDS-2001-002, The Parallel and Distributed Systems Laboratory, Department of Electrical andComputer Engineering, The University of Texas at Austin, April 2001. Available at http://www.cs.utexas.edu/users/neerajm.
13. N. Mittal and V. K. Garg. On Detecting Global Predicates in DistributedComputations. In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems (ICDCS), pages 3–10, Phoenix, Arizona, April 2001.
14. R. H. B. Netzer and J. Xu. Necessary and Sufficien t Conditions for Consistent Global Snapshots. IEEE Transactions on Parallel and Distributed Systems, 6(2):165–169, February 1995.
15. S. D. Stoller and F. Schnieder. Faster Possibility Detection by Combining Two Approaches. In Proceedings of the Workshop on Distributed Algorithms (WDAG), France, September 1995.
16. A. Tarafdar and V. K. Garg. Predicate Control for Active Debugging of Distributed Programs. In Proceedings of the 9th IEEE Symposium on Parallel and Distributed Processing (SPDP), Orlando, 1998.
17. A. Tarafdar and V. K. Garg. Software Fault Tolerance of Concurrent Programs Using ControlledRe-execution. In Proceedings of the 13th Symposium on Distributed Computing (DISC), pages 210–224, Bratislava, Slovak Republic, September 1999.
18. Yi-Min Wang. Consistent Global Checkpoints that Contain a Given Set of Local Checkpoints. IEEE Transactions on Computers, 46(4):456–468, April 1997.
19. M. Weiser. Programmers Use Slices when Debugging. Communications of the ACM (CACM), 25(7):446–452, 1982.