Improving program slicing with dynamic points-to data

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2002, Pages 71-80

  Mock, Markus ^a   Atkinson, Darren C ^b   Chambers, Craig ^a   Eggers, Susan J ^a  

^a University of Washington   (United States)

^b Santa Clara University   (United States)

Author keywords

Dynamic analysis; Points to analysis; Program slicing

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; COMPUTER SOFTWARE MAINTENANCE; DATA FLOW ANALYSIS; DATA STRUCTURES; OBJECT ORIENTED PROGRAMMING; PROGRAM DEBUGGING; REVERSE ENGINEERING; SEMANTICS;

DYNAMIC ANALYSIS; POINTS TO ANALYSIS; PROGRAM SLICING;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 0038011042     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/605466.605477     Document Type: Conference Paper

References (34)

1. G. M. Amdahl. Validity of the single processor approach to achieving large scale computing capabilities. In Proceedings of the AFIPS 1967 Joint Computer Conference, pages 483-485, Atlantic City, NJ, Apr. 1967.
2. L. O. Andersen. Program Analysis and Specialization for the C Programming Language. Ph.D. dissertation, University of Copenhagen, Department of Computer Science, May 1994.
3. D. C. Atkinson. The Design and Implementation of Practical and Task-Oriented Whole-Program Analysis Tools. Ph.D. dissertation, University of California, San Diego, Department of Computer Science & Engineering, Apr. 1999.
4. D. C. Atkinson and W. G. Griswold. The design of whole-program analysis tools. In Proceedings of the 18th International Conference on Software Engineering, pages 16-27, Berlin, Germany, Mar. 1996.
5. D. C. Atkinson and W. G. Griswold. Effective whole-program analysis in the presence of pointers. In Proceedings of the 6th ACM International Symposium on the Foundations of Software Engineering, pages 46-55, Lake Buena Vista, FL, Nov. 1998.
6. D. C. Atkinson and W. G. Griswold. Implementation techniques for efficient data-flow analysis of large programs. In Proceedings of the 2001 International Conference on Software Maintenance, pages 52-61, Florence, Italy, Nov. 2001.
7. L. Beltracchi, J. R. Lyle and D. R. Wallace. Using a program slicing CASE tool for evaluating high integrity software systems. In Proceedings of the 1996 American Nuclear Society International Topical Meeting on Nuclear Plant Instrumentation, Control, and Human-Machine Interface Technologies, pages 1033-1039, University Park, PA, May 1996.
8. L. Bent, D. C. Atkinson, and W. G. Griswold. A comparative study of two whole programs slicers for C. Computer Science Technical Report CS2001-0668, University of California, San Diego, Department of Computer Science & Engineering, Apr. 2001.
9. M. Das. Unification-based pointer analysis with directional assignments. In Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation, Vancouver, BC, June 2000.
10. M. A. Francel and S. Rugaber. The value of slicing while debugging. In Proceedings of the 7th International Workshop on Program Comprehension, pages 151-169, Pittsburgh, PA, May 2001.
11. K. B. Gallagher and J. R. Lyle. Using program slicing in software maintenance, IEEE Trans. Softw. Eng., 17(8):751-761, Aug. 1991.
12. R. Ghiya, D. Lavery, and D. Sehr. On the importance of points-to analysis and other memory disambiguation methods for C programs. In Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 47-58, Snowbird, UT, June 2001.
13. GrammaTech, Inc. Codesurfer user guide and reference manual
14. M. J. Harrold and N. Ci. Reuse-driven interprocedural slicing. In Proceedings of the 20th International Conference on Software Engineering, pages 74-83, Kyoto, Japan, Apr. 1998.
15. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. Prog. Lang. Syst., 12(1):26-60, Jan. 1990.
16. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In Proceedings of the 3rd ACM Symposium on the Foundations of Software Engineering, Washington, DC, Oct. 1995.
17. D. Liang and M. J. Harrold. Efficient points-to analysis for whole-program analysis. In Proceedings of the 7th European Software Engineering Conference and ACM Symposium on the Foundations of Software Engineering, Toulouse, France, Sept. pages 199-215, 1999.
18. D. Liang and M. J. Harrold. Reuse-driven interprocedural slicing in the presence of pointers and recursion. In Proceedings of the 1999 International Conference on Software Maintenance, pages 421-432, Oxford, England, Aug. 1999.
19. D. Liang and M. J. Harrold. Light-weight context recovery for efficient and accurate program analyses. In Proceedings of the 2000 International Conference on Software Engineering, pages 366-375, Limerick, Ireland, June 2000.
20. M. Mock, D. C. Atkinson, C. Chambers, and S. J. Eggers. Gathering dynamic points-data and its incorporation in a program slicing tool for C programs. School of Engineering Technical Report COEN-2002-03-16, Santa Clara University, Department of Computer Engineering, Mar. 2002.
21. M. Mock, M. Berryman, C. Chambers, and S. J. Eggers. Calpa: A tool for automating dynamic compilation. In Proceedings of the 2nd Workshop on Feedback-Directed Optimization, pages 100-109, Haifa, Israel, Nov. 1999.
22. M. Mock, C. Chambers, and S. J. Eggers. Calpa: A tool for automating selective dynamic compilation. In Proceedings of the 33rd Annual Symposium on Microarchitecture, pages 291-302, Monterey, CA, Dec. 2000.
23. M. Mock, M. Das, C. Chambers, and S. J. Eggers. Dynamic points-to sets: A comparison with static analyses and potential applications in program understanding and optimization. In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 66-72, Snowbird, UT, June 2001.
24. H. D. Pande, W. A. Landi, and B. G. Ryder, Interprocedural def-use associations for C systems with single level pointers. IEEE Trans. Softw. Eng., 20(5):385-403, May 1994.
25. A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. In Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 47-56, Vancouver, BC, June 2000.
26. B. G. Ryder, W. Landi, P. Stocks, S. Zhang, and R. Altucher, A schema for interprocedural side effect analysis with pointer aliasing, ACM Trans. Prog. Lang. Syst., 23(2):105-186, Mar. 2001.
27. M. Shapiro and S. Horwitz. The effects of the precision of pointer analysis. In Proceedings of the 4th International Symposium on Static Analysis, pages 16-34, Paris, France, Jan. 1997.
28. M. Shapiro and S. Horwitz. Fast and accurate flow-insensitive points-to analysis. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pages 1-14, Paris, France, Jan. 1997.
29. O. Shivers. Control-Flow Analysis of Higher-Order Languages. Ph.D. dissertation, Carnegie Mellon University, School of Computer Science, May 1991.
30. B. Steensgaard. Points-to analysis in almost linear time. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 32-41, St. Petersburg Beach, FL, Jan. 1996.
31. F. Tip. A survey of program slicing techniques. J. Prog. Lang., 3(3):121-189, Sept. 1995.
32. F. Tip and T.B. Dinesh. A slicing-based approach for locating type errors. ACM Trans. Softw. Eng. Meth., 10(1):5-55, Jan. 2001.
33. M. Weiser. Program slicing: IEEE Trans. Softw. Eng., SE-10(4):352-357, July 1984.
34. R. P. Wilson and M. S. Lam. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 1-12, La Jolla, CA, June 1995.