Software fault tolerance of distributed programs using computation slicing

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2003, Pages 105-113

  Mittal, Neeraj ^a   Garg, Vijay K ^b  

^a The University of Texas at Dallas   (United States)

^b The University of Texas at Austin   (United States)

Author keywords

Partial order methods; Predicate detection; Pruning search space; Software fault tolerance; Testing and debugging

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; PROGRAM DEBUGGING;

COMPUTATION SLICING; PARTIAL-ORDER METHODS; PREDICATE DETECTION; PRUNING SEARCH-SPACE; SOFTWARE FAULT TOLERANCE;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 0037630618     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. S. Alagar and S. Venkatesan, Techniques to Tackle State Explosion in Global Predicate Detection. IEEE Transactions on Software Engineering, 27(8):704-714, Aug. 2001.
2. 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.
3. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order. Cambridge University Press, Cambridge, UK, 1990.
4. V. K. Garg. Elements of Distributed Computing. John Wiley and Sons, Incorporated, New York, NY, 2002.
5. V. K. Garg and N. Mittal. On Slicing a Distributed Computation. In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems (ICDCS), pages 322-329, Phoenix, Arizona, Apr. 2001.
6. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems, volume 1032 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
7. R. Jegou, R. Medina, and L. Nourine. Linear Space Algorithm for On-line Detection of Global Predicates. In J. Desel, editor, Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT), pages 175-189, Springer-Verlag, 1995.
8. L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM (CACM), 21(7):558-565, July 1978.
9. N. Mittal. Techniques for Analyzing Distributed Computations. PhD thesis, The University of Texas at Austin, May 2002. Available at "http://www.utdallas.edu/~neerajm".
10. N. Mittal and V. K. Garg. Computation Slicing: Techniques and Theory. In Proceedings of the Symposium on Distributed Computing (DISC), pages 78-92, Lisbon, Portugal, Oct. 2001.
11. N. Mittal and V. K. Garg. On Detecting Global Predicates in Distributed Computations. In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems (ICDCS), pages 3-10, Phoenix, Arizona, Apr. 2001.
12. S. D. Stoller and F. Schneider. Faster Possibility Detection by Combining Two Approaches. In Proceedings of the Workshop on Distributed Algorithms (WDAG), volume 972 of Lecture Notes in Computer Science (LNCS), pages 318-332, France, Sept. 1995.
13. S. D. Stoller, L. Unnikrishnan, and Y. A. Liu. Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods. In Proceedings of the 12th International Conference on Computer-Aided Verification (CAV), volume 1855 of Lecture Notes in Computer Science (LNCS), pages 264-279, Springer-Verlag, July 2000.