Dynamic slicing on Java bytecode traces

ACM Transactions on Programming Languages and Systems

Volumn 30, Issue 2, 2008, Pages

  Wang, Tao ^a   Roychoudhury, Abhik ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Debugging; Program slicing; Tracing

Indexed keywords

BYTECODE TRACES; DYNAMIC SLICING; DYNAMIC SLICING ALGORITHM; OPTIMIZED REPRESENTATION;

ALGORITHMS; DATA COMPRESSION; PROGRAM DEBUGGING; PROGRAM DIAGNOSTICS;

JAVA PROGRAMMING LANGUAGE;

EID: 41149168609     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1330017.1330021     Document Type: Article

References (44)

1. AGRAWAL, H. 1991. Towards automatic debugging of computer programs. Ph.D. dissertation, Purdue University.
2. AGRAWAL, H. AND HORGAN, J. 1990. Dynamic program slicing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). ACM, New York, 246-256.
3. AGRAWAL, H., HORGAN, J., KRAUSER, E., AND LONDON, S. 1993. Incremental regression testing. In Proceedings of the International Conference on Software Maintenance (ICSM) (Washington, DC). IEEE Computer Society Press, Los Alamitos, CA, 348-357.
4. AKGUL, T., MOONEY, V., AND PANDE, S. 2004. A fast assembly level reverse execution method via dynamic slicing. In Proceedings of the International, Conference on Software Engineering (ICSE) (Edinburgh, Scotland). IEEE Computer Society Press, Los Alamitos, CA, 522-531.
5. ANDERSEN, L. O. 1994. Program analysis and specialization for the C progranzming language. Ph.D. dissertation, University of Copenhagen.
6. BERK, E. J. AND ANANIAN, C. S. 2003. A lexical analyzer generator for Java, website: http://www.cs.princeton.edu/~appel/ modarn/java/JLex/.
7. DHAMDHERE, D., GURURAJA, K., AND GANU, P. 2003. A compact execution history for dynamic slicing. Inf. Proc. Lett. 86, 145-152.
8. FERRANTE, J., OTTENSTEIN, K., AND WARREN, J. 1987. The program dependence graph and its use in optimization. ACM Trans. Prog. Lang. Syst. 9, 3, 319-349.
9. GOEL, A., ROYCHOUDHURY, A., AND MITRA, T. 2003. Compactly representing parallel program executions. In Proceedings of the ACM Symposium on Principles and Practice of Parallel Programming (PPoPP). San Diego, CA, USA, 191-202.
10. GYIMÓTHY, T, BESZÉDES, A., AND FORGÁCS, I. 1999. An efficient relevant slicing method for debugging. In Proceedings of the 7th ACM SIGSOFT International Symposium on Foundations of Software Engineering (Toulouse, France). ACM, New York, 303-321.
11. HORWITZ, S., REPS, T., AND BINKLEY, D. 1990. Interprocedural slicing using dependence graphs. ACM Trans. Prog. Lang. Syst. (TOPLAS) 12, 1, 26-60.
12. JGF. The Java Grande Forum Benchmark Suite, website: http://www.epcc.ed. ac.uk/javagrande/seq/contents.html.
13. JOY, B., STEELE, G., GOSLING, J., AND BRACHA, G. 2000. Java(TM) Language Specification (2nd Edition). Prentice Hall, Englewood Cliffs, NJ.
14. KAFFE. The Kaffe virtual machine, website: http://www.kaf fe.org.
15. KOREL, B. AND LASKI, J. W. 1988. Dynamic program slicing. Inf. Proc. Lett. 29, 3, 155-163.
16. KOREL, B. AND RILLING, J. 1997. Application of dynamic slicing in program debugging. In Proceedings of the International Workshop on Automatic Debugging (Linkoping, Sweden). Springer-Verlag, New York.
17. LAMPORT, L. 1997. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21, 558-565.
18. LARSEN, L. AND HARROLD, M. 1996. Slicing object-oriented software. In Proceedings of the ACM/IEEE International Conference on Software Engineering (ICSE) (Berlin, Germany). IEEE Computer Society Press, Los Alamitos, CA, 495-505.
19. LARUS, J. 1990. Abstract execution: A technique for efficiently tracing programs. Software - Practice and Experience (SPE) 20, 1241-1258.
20. LARUS, J. R. 1999. Whole program paths. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). ACM, Atlanta, Georgia, USA, 259-269.
21. LEVROUW, L. J., AUDENAERT, K. M. R., AND CAMPENHOUT, J. M. 1994. A new trace and replay system for shared memory programs based on lamport clocks. In Proceedings of the 2nd Euromicro Workshop on Parallel and Distributed Processing. IEEE Computer Society, ELIS, Universiteit Gent, Belgium, 471-478.
22. LHOTÂK, O. 2002. Spark: A flexible points-to analysis framework for Java. M.S. dissertation, McGill University.
23. LINDHOLM, T. AND YELLIN, F. 1999. The Java(TM) Virtual Machine Specification (2nd Edition). Prentice Hall, Englewood Cliffs, NJ.
24. LUCIA, A. D. 2001. Program slicing: Methods and applications. In Proceedings of the IEEE International Workshop on Source Code Analysis and Manipulation (Florence, Italy). IEEE Computer Society Press, Los Alamitos, CA, 142-149.
25. MAJUMDAR, R. AND JHALA, R. 2005. Path slicing. In Proceedings of the International Conference on Programming Language Design and Implementation (PLDI) (Chicago, IL). ACM, New York.
26. NEVILL-MANNING, C. G. AND WITTEN, I. H. 1997. Linear-time, incremental hierarchy inference for compression. In Proceedings of the Data Commpression Conference (DCC) (Snowbird, Utah). IEEE Computer Society Press, Los Alamitos, CA, 3-11.
27. OHATA, F., HIROSE, K., FUJII, M., AND INOUE, K. 2001. A slicing method for object-oriented programs using lightweight dynamic information. In Proceedings of the Asia-Pacific Software Engineering Conference (Macau, China). IEEE Computer Society Press, Los Alamitos, CA.
28. PLESZKUN, A. R. 1994. Techniques for compressing programm address traces. In Proceedings of the IEEE/ACM International Symposium on Microarchitecture (MICRO) (San Jose, CA). ACM, New York, 32-39.
29. REISS, S. P. AND RENIERIS, M. 2001. Encoding program executions. In Proceedings of the ACMI IEEE International Conference on Software Engineering (ICSE) (Toronto, Ont., Canada). IEEE Computer Society Press, Los Alamitos, CA, 221-230.
30. RONSSE, M. AND BOSSCHERE, K. D. 1999. Recplay: A fully integrated practical record/replay system. ACM Trans. Comput. Syst. (TOCS) 17, 133-152.
31. SAZEIDES, Y. 2003. Instruction isomorphism in program execution. J. Instruction-Level Paral. 5.
32. SINHA, S. AND HARROLD, M. J. 2000. Analysis and testing of programa with exceptionhandling constructs. IEEE Trans. Softw. Eng. 26, 9, 849-871.
33. SPECJVM98. 1998. Spec JVM98 benchmarks, website: http://www.specbench.org/osg/jvm98/.
34. STEENSGAARD, B. 1996. Points-to analysis in almost linear time. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (St. Petersburg Beach, FL). ACM, New York, 32-41.
35. TIP, F. 1995. A survey of program slicing techniques. J. Prog. Lang. 3, 3, 121-189.
36. VALLÉE-RAI, R., CO, P., GAGNON, E., HENDREN, L., LAM, P., AND SUNDARESAN, V. 1999. Soot - A Java bytecode optimization framework. In Proceedings of the Conference of the Centre for Advanced Studies on Collaborative Research (CASCON) (Mississauga, Ontario, Canada). IBM Press. 13.
37. WANG, T. AND ROYCHOUDHURY, A. 2007. Dynamic slicing on Java bytecode traces. Tech. Rep. TRB3/07, National University of Singapore. March, http://www.comp.nus.edu.sg/"abhik/pdf/ JSlice-TR.pdf.
38. WEISER, M. 1984. Program slicing. IEEE Trans. Softw. Engineering 10, 4, 352-357.
39. XU, B., CHEN, Z., AND YANG, H. 2002. Dynamic slicing object-oriented programs for debugging. In Proceedings of the IEEE International Workshop on Source Code Analysis and Manipulation (Montreal, Canada). IEEE Computer Society Press, Los Alamitos, CA.
40. ZHANG, Y. AND GUPTA, R. 2001. Timestamped whole program path representation and its applications. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Snowbird, UT). ACM, New York, 180-190.
41. ZHANG, X. AND GUPTA, R. 2004. Whole execution traces. In Proceedings of the IEEE/ACM International Symposium on Microarchitecture (MICRO) (Portland, OR). IEEE Computer Society Press, Los Alamitos, CA, 105-116.
42. ZHANG, X., GUPTA, R., AND ZHANG, Y. 2005. Cost and precision tradeoffs of dynamic data slicing algorithms. ACM Trans. Prog. Lang. Syst. (TOPLAS) 27, 631-661.
43. ZHAO, J. 2000. Dependence analysis of Java bytecode. In IEEE Annual International Computer Software and, Applications Conference (Taipei, Taiwan). IEEE Computer Society Press, Los Alamitos, CA, 486-491.
44. ZILLES, C. B. AND SOHI, G. 2000. Understanding the backward slices of performance degrading instructions. In Proceedings of the International Symposium on Computer Architecture (ISCA) (Vancouver, BC, Canada). IEEE Computer Society Press, Los Alamitos, CA, 172-181.