Efficient flow-sensitive interprocedural data-flow analysis in the presence of pointers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3923 LNCS, Issue , 2006, Pages 17-31

  Tok, Teck Bok ^a   Guyer, Samuel Z ^b   Lin, Calvin ^a  

^a University of Texas at Austin   (United States)

^b Tufts University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; ERROR ANALYSIS; INFORMATION ANALYSIS; NUMERICAL METHODS; PROBLEM SOLVING;

DEF-USE CHAINS; FLOW VALUES; INTER-PROCEDURAL ANALYSES; POINTER ANALYSIS;

DATA FLOW ANALYSIS;

EID: 33745800062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11688839_3     Document Type: Conference Paper

References (25)

1. A. V. Aho and J. D. Ullman. Node listings for reducible flow graphs. In Proc. 7th Annual ACM Symp. on Theory of Computing, pages 177-185, 1975.
2. Darren C. Atkinson and William G. Griswold. Implementation techniques for efficient data-flow analysis of large programs. In Proc. IEEE Int'l Conf. on Software Maintenance (ICSM'01), pages 52-61, November 2001.
3. J. Choi, M. Burke, and P. Carini. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In POPL, pages 232-245, 1993.
4. J. Choi, R. Cytron, and J. Ferrante. Automatic construction of sparse data flow evaluation graphs. In POPL, pages 55-66, 1991.
5. Jamieson M. Cobleigh, Lori A. Clarke, and Leon J. Osterweil. The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification. In Int'l Conf. on Software Engineering, pages 37-46, May 2001.
6. Jeffrey S. Foster, Tachio Terauchi, and Alex Aiken. Flow-sensitive type qualifiers. In ACM SIGPLAN'02 Proc. 2002 PLDI, pages 1-12, June 2002.
7. Samuel Z. Guyer and Calvin Lin. Client driven pointer analysis. In Radhia Cousot, editor, 10th Annual Int'l Static Analysis Symp. (SAS '03), volume 2694 of Lecture Notes on Computer Science, pages 214-236, June 2003.
8. Samuel Z. Guyer and Calvin Lin. An annotation language for optimizing software libraries. In 2nd Conf. on Domain Specific Languages, pages 39-53, October 1999.
9. Michael Hind and Anthony Pioli. Which pointer analysis should 1 use? In ACM SIGSOFT Int'l Symp. on Software Testing and Analysis (ISSTA 2000), pages 113-123, August 2000.
10. Michael Mind and Anthony Pioli. Assessing the effects of flow-sensitivity on pointer alias analysis. In 5th Annual Int'l Static Analysis Symp. (SAS'98), volume 1503 of Lecture Notes on Computer Science, pages 57-81, September 1998.
11. Susan Horwitz, Thomas Reps, and Mooly Sagiv. Demand interprocedural dataflow analysis. In ACM 3rd Symp. on the. Foundations of Software Engineering, pages 104-115, 1995.
12. Matthew S. Hecht and Jeffrey D. Ullman. Analysis of a simple algorithm for global data flow problems. In POPL, pages 207-217, 1973.
13. K. W. Kennedy. Node listings applied to data flow analysis. In Proc. 2th ACM Symp. on Principles of Programming Languages, pages 10-21, 1975.
14. John B. Kam and Jeffrey D. Ullman. Global Data Flow Analysis and Iterative Algorithms. Journal of ACM, 23(1): 158-171, 1976.
15. Sungdo Moon et al. S YZYGY - a framework for scalable cross-module IPO. In 2004 Int'l Symp. on Code Generation and Optimization with Special Emphasis on Feedback-Directed and Runtime Optimization, pages 65-74, March 2004.
16. Eugene M. Myers. A precise inter-procedural data flow algorithm. In Proc, 8th ACM Symp. on Principles of Programming Languages, pages 219-230, January 1981.
17. G. Ramalingam. On sparse evaluation representations. Research Report RC 21245(94831), IBM Research, July 1998.
18. Barbara G. Ryder, William A. Landi, Philip A. Stocks, Scan Zhang, and Rita Allucher. A schema for interprocedural modification side-effect analysis with pointer aliasing", In ACM Transactions on Programming languages and Systems, 23(1): 105-186, March 2001.
19. Atanas Rountev, Barbara G. Ryder, and William A. Landi. Data-flow Analysis of Program Fragments. In Proc. 7th Symposium on the Foundations of Software Engineering, pages 235-253, September 1999.
20. Erik Ruf. Partitioning dataflow analyses using types. In Proc. 24th ACM SIGPIAN-SIGACT Symp. on Principles of Programming languages, pages 15-26, January 1997.
21. Barbara G. Ryder and Marvin C. Paull. Elimination algorithms for data flow analysis. ACM Computing Surveys (CSUR), 18(3):277-316, September 1986.
22. Frank Tip. A survey of program slicing techniques. Journal of Programming Languages, 3, 1995.
23. Mark N. Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2): 181-210, April 1991.
24. John Whaley and Monica S. Lam. Cloning-Based Context-Sensitive Pointer Alias Analyses Using Biliary Decision Diagrams. In ACM SIGPLAN'04 Proc. 2004 PLDI, pages 131-144, June 2004.
25. Jianwen Zhu and Silvian Calman. Symbolic Pointer Analysis Revisited. In ACM SIGPIAN'04 Proc. 2004 PLDI, pages 145-157, June 2004.