Equivalence analysis and its application in improving the efficiency of program slicing

ACM Transactions on Software Engineering and Methodology

Volumn 11, Issue 3, 2002, Pages 347-383

  Liang, Donglin ^a,b   Harrold, Mary Jean ^a,b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

D.2.5 Software Engineering : Testing and Debugging Testing tools; D.2.7 Software Engineering : Distribution, Maintenance, and Enhancement Restructuring, reverse engineering, and reengineering

Indexed keywords

ALIAS ANALYSIS; DATA-FLOW ANALYSIS; MEMORY LOCATIONS; PROGRAM SLICING;

ALGORITHMS; COMPUTER SCIENCE; DATA REDUCTION; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM DEBUGGING; SOFTWARE ENGINEERING;

COMPUTER PROGRAMMING;

EID: 2442614999     PISSN: 1049331X     EISSN: None     Source Type: Journal    
DOI: 10.1145/567793.567796     Document Type: Article

References (30)

1. ANDERSEN, L. O. 1994. Program analysis and specialization for the C programming language. Tech. Rep. 94-19, University of Copenhagen.
2. ATKINSON, D. AND GRISWOLD, W. 1998. Effective whole-program analysis in the presence of pointers. In Proceedings of the Sixth Symposium on the Foundation of Software Engineering (Nov.), 46-55.
3. ATKINSON, D. C. AND GRISWOLD, W. G. 1996. The design of whole-program analysis tools. In Proceedings of the Eighteenth International Conference on Software Engeering (March), 16-27.
4. BERGERETTI, J.-F. AND CARRE, B. A. 1985. Information-flow and data-flow analysis of while-programs. ACM Trans. Prog. Lang. Syst. 7, 1, 37-61.
5. CHOI, J. D., CYTRON, R., AND FERRANTE, J. 1994. On the efficient engineering of ambitious program analysis. IEEE Trans. Softw. Eng. 20, 2 (Feb.), 105-114.
6. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1989. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth ACM Symposium on Principles of Programming Languages, 25-35.
7. DUESTERWALD, E., GUPTA, R., AND SOFFA, M. L. 1994. Reducing the cost of data flow analysis by congruence partitioning. In Fifth International Conference on Compiler Construction. (April), 357-373.
8. EMAMI, M., GHIYA, R., AND HENDREN, L. J. 1994. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of SIGPLAN'94 Conference on Programming Language Design and Implementation (June), 242-256.
9. GALLAGHER, K. B. AND LYLE, J. R. 1991. Using program slicing in software maintenance. IEEE Trans. Softw. Eng. 17, 8 (Aug.), 751-761.
10. GHIYA, R. AND HENDREN, L. J. 1998. Putting pointer analysis to work. In Conference Record of POPL '98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (Jan.), 121-133, 19-21.
11. GUPTA, R., HARROLD, M. J., AND SOFFA, M. L. 1992. An approach to regression testing using slicing. In Proceedings of the Conference on Software Maintenance-1992. (Nov.), 299-308.
12. HARROLD, M. J. AND CI, N. 1998. Reuse-driven interprocedural slicing. In The Twentieth International Conference on Software Engineering (April), 74-83.
13. HIND, M. AND PIOLI, A. 2000. Which pointer analysis should i use? In International Symposium on Software Testing and Analysis (August), 113-123.
14. HOPCROFT, J. E. 1971. An nlogra algorithm for minimizing states in finite automata. In Theory of Machines and Computations. Academic, New York.
15. HORWITZ, S., REPS, T., AND BINKLEY, D. 1990. Interprocedural slicing using dependence graphs. ACM Trans. Prog. Lang. Syst. 12, 1 (Jan.), 26-60.
16. LANDI, W. AND RYDER, B. G. 1992. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of 1992 ACM Symposium on Programming Language Design and Implementation (June), 235-248.
17. LIANG, D. AND HARROLD, M. J. 1999a. Efficient points-to analysis for whole-program analysis. In Joint Seventh European Software Engineering Conference and Seventh ACM Symposium on Foundations of Software Engineering (Sept.), 199-215.
18. LIANG, D. AND HARROLD, M. J. 1999b. Reuse-driven interprocedural slicing in the presence of pointers and recursion. In International Conference on Software Maintenance (August), 421-430.
19. OTTENSTEIN, K J. AND OTTENSTEIN, L. M. 1984. The program dependence graph in a software development environment. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments (March), 177-184.
20. PROGRAMMING LANGUAGES RESEARCH GROUP. 1998. PROLANGS analysis framework Rutgers University. Available at http://www.prolangs.rutgers.edu.
21. REPS, T. AND BRICKER, T. 1989. Illustrating interference in interfering versions of programs. In Proceedings of the Second International Workshop on Software Configuration Management, 46-55.
22. ROUNTEV, A. AND CHANDRA, S. 2000. Off-line variable substitution for scaling points-to analysis. In Proceedings of ACM SIGPLAN'00 Conference on Programming Language Design and Implementation (June), 47-56.
23. RYDER, B. G., LANDI, W. A., STOCKS, P., ZHANG, S., AND ALTUCHER, R. 2001. A schema for interprocedural modification side effects analysis with pointer aliasing. ACM Trans. Prog. Lang. Syst. 23, 1 (March), 105-186.
24. SHAPIRO, M. AND HORWTTZ, S. 1997a. The effects of the precision of pointer analysis. In Static Analysis fourth International Symposium, (Sept.) Lecture Notes in Computer Science, vol. 1302, Springer-Verlag, New York, 16-34.
25. SHAPIRO, M. AND HORWITZ, S. 1997b. Fast and accurate flow-insensitive points-to analysis. In Conference Record of the 24th ACM Symposium on Principles of Programming Languages, 1-14.
26. STEENSGAARD, B. 1996a. Points-to analysis by type inference of programs with structures and unions. In Proceedings of the International Conference on Compiler Construction, 136-150.
27. STEENSGAARD, B. 1996b. Points-to analysis in almost linear time. In Conference Record of the 23rd ACM Symposium on Principles of Programming Languages, 32-41.
28. WEISER, M. 1984. Program slicing. IEEE Trans. Softw. Eng. 10, 4 (July), 352-357.
29. ZHANG, S., RYDER, B. G., AND LANDI, W. 1996. Program decomposition for pointer analysis: A step toward practical analyses. In Proceedings of the Fourth Symposium on the Foundation of Software Engineering (Nov.), 81-92.
30. ZHANG, S., RYDER, B. G., AND LANDI, W. 1998. Experiments with combined analysis for pointer aliasing. In Program Analysis for Software Tools and Engineering '98, 11-18.