Efficient checkpointing of java software using context-sensitive capture and replay

6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE 2007

Volumn , Issue , 2007, Pages 85-94

  Xu, Guoqing ^a   Rountev, Atanas ^a   Tang, Yan ^a   Qin, Feng ^a  

^a The Ohio State University

Author keywords

Checkpoint; Replay

Indexed keywords

CHECKPOINTING; JAVA SOFTWARE; APPLICATION LEVELS; AUTOMATED DEBUGGING; CHECKPOINT; DYNAMIC SLICING; EXECUTION TIMES; EXPERIMENTAL STUDIES; JAVA SOFTWARES; LANGUAGE LEVELS; PROGRAM POINTS; PROGRAM STATES; REPLAY; STATIC AND DYNAMICS; SYSTEM LEVELS; TIME VALUES;

SOFTWARE ENGINEERING; STATIC ANALYSIS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; ENGINEERING; FAULT TOLERANCE; JAVA PROGRAMMING LANGUAGE; PROGRAM DEBUGGING; QUALITY ASSURANCE; RELIABILITY; SOFTWARE TESTING;

JAVA PROGRAMMING LANGUAGE; CONCURRENCY CONTROL;

EID: 37849053411     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1287624.1287638     Document Type: Conference Paper

References (36)

1. A. Borg, J. Baumbach, and S. Glazer. A message system supporting fault tolerance. In Symp. Operating Systems Principles, pages 90-99, 1983.
2. Y. Chen, J. S. Plank, and K. Li. CLIP: A checkpointing tool for message-passing parallel programs. In Conf. Supercomputing, pages 1-11, 1997.
3. J. Choi, M. Gupta, M. Serrano, V. Sreedhar, and S. Midkiff. Escape analysis for Java. In Conf. Object-Oriented Programming Systems, Languages, and Applications, pages 1-19, 1999.
4. J.-D. Choi, B. Alpern, T. Ngo, and J. Vlissides. A perturbation-free replay platform for cross-optimized multithreaded applications. In Int. Parallel and Distributed Processing Symp., page 10023a, 2001.
5. J.-D. Choi, K. Lee, A. Loginov, R. O'Callahan, V. Sarkar, and M. Sridharan. Efficient and precise datarace detection for multithreaded object-oriented programs. In Conf. Programming Language Design and Implementation, pages 258-269, 2002.
6. M. Christiaens, J.-D. Choi, M. Ronsse, and K. D. Bosschere. Record/play in the presence of benign data races. In Int. Conf. Parallel and Distributed Processing Techniques and Applications, pages 1200-1206, 2002.
7. H. Cleve and A. Zeller. Locating causes of program failures. In Int. Conf. Software Engineering, pages 342-351, 2005.
8. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In Symp. Principles of Programming Languages, pages 25-35, 1989.
9. G. W. Dunlap, S. T. King, S. Cinar, M. A. Basrai, and P. M. Chen. ReVirt: Enabling intrusion analysis through virtual-machine logging and replay. In Symp. Operating Systems Design and Implementation, pages 211-224, 2002.
10. S. Elbaum, H. N. Chin, M. B. Dwyer, and J. Dokulil. Carving differential unit test cases from system test cases. In Symp. Foundations of Software Engineering, pages 253-264, 2006.
11. E. N. M. Elnozahy, L. Alvisi, Y.-M. Wang, and D. B. Johnson. A survey of rollback-recovery protocols in message-passing systems. ACM Computing Surveys, 34(3):375-408, 2002.
12. M. Kasbekar, C. R. Das, S. Yajnik, R. Klemm, and Y. Huang. Issues in the design of a reflective library for checkpointing C++ objects. In Symp. Reliable Distributed Systems, page 224, 1999.
13. S. T. King, G. W. Dunlap, and P. M. Chen. Debugging operating systems with time-traveling virtual machines. In USENIX Annual Technical Conf., pages 1-15, 2005.
14. B. Korel and J. Laski. Dynamic program slicing. Information Processing Letters, 29(3):155-163, Oct. 1988.
15. J. L. Lawall and G. Muller. Efficient incremental checkpointing of Java programs. In Int. Conf. Dependable Systems and Networks, pages 61-70, 2000.
16. O. Lhoták and L. Hendren. Scaling Java points-to analysis using Spark. In Int. Conf. Compiler Construction, LNCS 2622, pages 153-169, 2003.
17. D. Liang and M. J. Harrold. Equivalence analysis: A general technique to improve the efficiency of data-flow analyses in the presence of pointers. In Workshop on Program Analysis for Software Tools and Engineering, pages 39-46, 1999.
18. R. H. B. Netzer and M. H. Weaver. Optimal tracing and incremental reexecution for debugging long-running programs. In Conf. Programming Language Design and Implementation, pages 313-325, 1994.
19. A. Orso, S. Joshi, M. Burger, and A. Zeller. Isolating relevant component interactions with JINSI. In Int. Workshop on Dynamic Analysis, pages 3-9, 2006.
20. A. Orso and B. Kennedy. Selective capture and replay of program executions. In Int. Workshop on Dynamic Analysis, pages 29-35, 2005.
21. D. Z. Pan and M. A. Linton. Supporting reverse execution for parallel programs. In Workshop on Parallel and Distributed Debugging, pages 124-129, 1988.
22. F. Qin, J. Tucek, J. Sundaresan, and Y. Zhou. Rx: Treating bugs as allergies - a safe method to survive software failures. In Symp. Operating Systems Principles, pages 235-248, 2005.
23. M. Ronsse, K. D. Bosschere, M. Christiaens, J. C. de Kergommeaux, and D. Kranzlmüller. Record/replay for nondeterministic program executions. Communications of the ACM, 46(9):62-67, 2003.
24. M. Ronsse, K. D. Bosschere, and J. C. de Kergommeaux. Execution replay and debugging. In Int. Workshop Automated Debugging, 2000.
25. A. Rountev, S. Kagan, and T. Marlowe. Interprocedural dataflow analysis in the presence of large libraries. In Int. Conf. Compiler Construction, LNCS 3923, pages 2-16, 2006.
26. M. Russinovich and B. Cogswell. Replay for concurrent non-deterministic shared-memory applications. In Conf. Programming Language Design and Implementation, pages 258-266, 1996.
27. D. Saff, S. Artzi, J. H. Perkins, and M. D. Ernst. Automatic test factoring for Java. In Int. Conf. Automated Software Engineering, pages 114-123, 2005.
28. Y. Saito. Jockey: A user-space library for record-replay debugging. In Int. Symp. Automated and Analysis-Driven Debugging, pages 69-76, 2005.
29. http://www.sable.mcgill.ca/soot.
30. S. Srinivasan, S. Kandula, C. Andrews, and Y. Zhou. Flashback: A lightweight extension for rollback and deterministic replay for software debugging. In USENIX Annual Technical Conf., pages 29-44, 2004.
31. R. Vallée-Rai, E. Gagnon, L. Hendren, P. Lam, P. Pominville, and V. Sundaresan. Optimizing Java bytecode using the Soot framework: Is it feasible? In Int. Conf. Compiler Construction, LNCS 1781, pages 18-34, 2000.
32. J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java programs. In Conf. Object-Oriented Programming Systems, Languages, and Applications, pages 187-206, 1999.
33. A. Zeller. Yesterday, my program worked. Today, it does not. Why? In Symp. Foundations of Software Engineering, pages 253-267, 1999.
34. A. Zeller. Isolating cause-effect chains from computer programs. In Symp. Foundations of Software Engineering, pages 1-10, 2002.
35. X. Zhang, H. He, N. Gupta, and R. Gupta. Experimental evaluation of using dynamic slices for fault location. In Int. Symp. Automated and Analysis-Driven Debugging, pages 33-42, 2005.
36. X. Zhang, S. Tallam, and R. Gupta. Dynamic slicing long running programs through execution fast forwarding. In Symp. Foundations of Software Engineering, pages 81-91, 2006.