Implementation techniques for efficient data-flow analysis of large programs

IEEE International Conference on Software Maintenance, ICSM

Volumn , Issue , 2001, Pages 52-61

  Atkinson, Darren C ^a   Griswold, William G ^b  

^a Santa Clara University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM SLICING; PROGRAM UNDERSTANDING;

C (PROGRAMMING LANGUAGE); DATA FLOW ANALYSIS; PROGRAM PROCESSORS; SYSTEMS ENGINEERING;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 57849114837     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2001.972711     Document Type: Conference Paper

References (18)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, 1986.
2. 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.
3. 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.
4. L. Bent, D. C. Atkinson, and W. G. Griswold. A comparative study of two whole programs slicers for C. Computer Science Techncial Report CS2000-0643, University of California, San Diego, Department of Computer Science & Engineering, 2000.
5. E. Duesterwald, R. Gupta, and M. L. Soffa. Demand-driven computation of interprocedural data flow. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages, pages 37-48, San Francisco, CA, Jan. 1995.
6. M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of the ACM '94 SIGPLAN ACM Conference on Programming Language Design and Implementation, pages 20-24, Orlando, FL, June 1994.
7. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Trans. Prog. Lang. Syst., 9(3):319-349, July 1987.
8. J. I. Gobat and D. C. Atkinson. The FElt system: User's guide and reference manual. Computer Science Technical Report CS94-376, University of California, San Diego, Department of Computer Science & Engineering, 1994.
9. W. G. Griswold and D. C. Atkinson. A syntax-directed tool for program understanding and transformation. In Proceedings of the 4th Systems Reengineering Technology Workshop, pages 274-282, Monterey, CA, Feb. 1994.
10. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. Prog. Lang. Syst., 12(1):26-60, Jan. 1990.
11. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In Proceedings of the 3rd ACM Symposium on the Foundations of Software Engineering, pages 104-115, Washington, DC, Oct. 1995.
12. D. Jackson. ASPECT: An economical bug-detector. In Proceedings of the 13th International Conference on Software Engineering, pages 13-22, Austin, TX, May 1991.
13. B. W. Kernighan and D. M. Ritchie. The C Programming Language. Prentice Hall, Englewood Cliffs, NJ, 2nd edition, 1988.
14. M. M. Lehman and L. A. Belady, editors. Program Evolution: Processes of Software Change. Academic Press, Orlando, FL, 1985.
15. T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Prog. Lang. Syst., 1(1):121-141, July 1979.
16. G. N. Naumovich, L. A. Clarke, and L. J. Osterweil. Verification of communication protocols using data flow analysis. In Proceedings of the 4th ACM Symposium on the Foundations of Software Engineering, pages 93-105, San Francisco, CA, Nov. 1996.
17. R. M. Stallman. GNU EMACS Manual. Free Software Foundation, Cambridge, MA, 1993.
18. M. Weiser. Program slicing. IEEE Trans. Softw. Eng., SE-10(4):352-357, July 1984.