Cost effective dynamic program slicing

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 1, Issue , 2004, Pages 94-106

  Zhang, Xiangyu ^a   Gupta, Rajiv ^a  

^a University of Arizona   (United States)

Author keywords

Debugging; Dynamic dependence graph; Testing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY; PROGRAM DEBUGGING; QUALITY CONTROL; SECURITY OF DATA; SOFTWARE ENGINEERING;

DYNAMIC DEPENDENCE GRAPH; DYNAMIC PROGRAM SLICING; PROGRAM TESTING;

COMPUTER PROGRAMMING;

EID: 8344277509     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996841.996855     Document Type: Conference Paper

References (28)

1. H. Agrawal and J. Horgan, "Dynamic Program Slicing," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 246-256, 1990.
2. H. Agrawal, R. DeMillo, and E. Spafford, "Debugging with Dynamic Slicing and Backtracking," Software Practice and Experience, 23(6):589-616, 1993.
3. T. Ball and J.R. Larus, "Efficient Path Profiling," IEEE/ACM International Symposium on Microarchitecture, 1996.
4. A. Beszedes, T. Gergely, Z.M. Szabo, J. Csirik, and T. Gyimothy, "Dynamic Slicing Method for Maintenance of Large C Programs," 5th European Conference on Software Maintenance and Reengineering, pages 105-113, March 2001.
5. T.M. Chilimbi, "Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 191-202, 2001.
6. D.M.D. Dhamdhere, K. Gururaja, and P.O. Ganu, "A Compact Execution History for Dynamic Slicing," Information Processing Letters, 85:(145-152), 2003.
7. E. Duesterwald, R. Gupta, and M.L. Soffa, "Distributed Slicing and Partial Re-execution for Distributed Programs," 5th LCPC Workshop, LNCS 757 Springer, pages 497-511, August 1992.
8. E. Duesterwald, R. Gupta, and M.L. Soffa, "Rigorous Data Flow Testing through Output Influences," 2nd Irvine Software Symposium, pages 131-145, UC Irvine, CA, March 1992.
9. J. Ferrante, K.J. Ottenstein, and J.D. Warren, "The Program Dependence Graph and Its Use in Optimization," ACM Transactions on Programming Languages and Systems, 9(3):319-349, 1987.
10. R. Gupta and M.L. Soffa, "Hybrid Slicing: An Approach for Refining Static Slices using Dynamic Information," ACM SIGSOFT Symp. on the Foundations of Software Engineering, pages 29-40, 1995.
11. N. Gupta and P. Rao, "Program Execution Based Module Cohesion Measurement," 16th IEEE International Conf. on Automated Software Engineering, pages 144-153, San Diego, CA November 2001.
12. T. Hoffner, "Evaluation and Comparison of Program Slicing Tools." Tech. Report, Dept. of Computer and Info. Science, Linkoping University, Sweden, 1995.
13. S. Jha, Private communication, University of Wisconsin at Madison, Department of Computer Science, 2003.
14. B. Korel and J. Laski, "Dynamic Program Slicing," Information Processing Letters, 29(3): 155-163, 1988.
15. B. Korel and J. Rilling, "Application of Dynamic Slicing in Program Debugging," Automated and Algorithmic Debugging, 1997.
16. M. Kamkar, "Interprocedural Dynamic Slicing with Applications to Debugging and Testing," PhD Thesis, Linkoping University, 1993.
17. B. Korel and S. Yalamanchili. "Forward Computation of Dynamic Program Slices," International Symposium on Software Testing and Analysis, August 1994.
18. J.R. Larus, "Whole Program Paths," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 259-269, Atlanta, GA, May 1999.
19. M. Mock, D.C. Atkinson, C. Chambers, and S.J. Eggers, "Improving Program Slicing with Dynamic Points-to Data," ACM SIGSOFT 10th Symp. on the Foundations of Software Engineering, 2002.
20. C.G. Nevil-Manning and I.H. Witten, "Linear-time, Incremental Hierarchy Inference for Compression," Data Compression Conference, Snowbird, Utah, IEEE Computer Society, pages 3-11, 1997.
21. T. Reps and G. Rosay, "Precise Interprocedural Chopping," Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, Washington, DC, pages 41-52, October 1995.
22. Y. Sazeides, "Instruction-Isomorphism in Program Execution," Value Prediction Workshop (held with ISCA), June 2003.
23. F. Tip, "A Survey of Program Slicing Techniques," Journal of Programming Languages, 3(3):121-189, Sept. 1995.
24. G. Venkatesh, "Experimental Results from Dynamic Slicing of C Programs," ACM Transactions on Programming Languages and Systems, 17(2):197-216, 1995.
25. M. Weiser, "Program Slicing," IEEE Transactions on Software Engineering, SE-10(4):352-357, 1982.
26. X. Zhang, R. Gupta, and Y. Zhang, "Precise Dynamic Slicing Algorithms," IEEE/ACM International Conference on Software Engineering, pages 319-329, Portland, Oregon, May 2003.
27. X. Zhang, R. Gupta, and Y. Zhang, "Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams," IEEE/ACM International Conference on Software Engineering, Edinburgh, UK, May 2004.
28. C.B. Zilles and G. Sohi, "Understanding the Backward Slices of Performance Degrading Instructions," ACM/IEEE 27th International Symposium on Computer Architecture, 2000.