Bottom-up and top-down context-sensitive summary-based pointer analysis

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

Volumn 3148, Issue , 2004, Pages 165-180

  Nystrom, Erik M ^a   Kim, Hong Seok ^a   Hwu, Wen Mei W ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCALABILITY;

BOTTOM-UP AND TOP-DOWN; CONTEXT SENSITIVE; CONTEXT SENSITIVITY; CONTEXT-INSENSITIVE ANALYSIS; CONTEXT-SENSITIVE ANALYSIS; POINTER ANALYSIS; PROCEDURE CALL; SECOND PHASE;

JAVA PROGRAMMING LANGUAGE;

EID: 35048845602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27864-1_14     Document Type: Article

References (27)

1. L. O. Andersen. Program analysis and specialization for the C programming language. Ph.D thesis, DIKU, Unversity of Copenhagen, 1994.
2. R. Chatterjee, B. G. Ryder, and W. A. Landi. Relevant context inference. In POPL, 1999.
3. B.-C. Cheng and W. W. Hwu. Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation. In PLDI, 2000.
4. J.-D. Choi, M. Gupta, M. J. Serrano, V. C. Sreedhar, and S. P. Midkiff. Stack allocation and synchronization optimizations for Java using escape analysis. TOPLAS, 2003.
5. E. Clarke, O. Grunmberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM, 1997.
6. M. Das. Unification-based pointer analysis with directional assignments. In PLDI, 2000.
7. M. Das, B. Liblit, M. Fähndrich, and J. Rehof. Estimating the impact of scalable pointer analysis on optimization. In SAS, 2001.
8. M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural pointsto analysis in the presence of function pointers. In PLDI, 1994.
9. M. Fähndrich, J. S. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. In PLDI, 1998.
10. M. Fähndrich, J. Rehof, and M. Das. Scalable context-sensitive flow analysis using instantiation constraints. In PLDI, 2000.
11. C. Flanagan and M. Felleisen. Componential set-based analysis. In PLDI, 1997.
12. J. S. Foster, M. Fahndrich, and A. Aiken. Polymorphic versus monomorphic flow-insensitive points-to analysis for C. In SAS, 2000.
13. S. Z. Guyer and C. Lin. Client-driven pointer analysis. In SAS, 2003.
14. N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: a million lines of C code in a second. In PLDI, 2001.
15. M. Hind. Pointer analysis: Haven't we solved this problem yet? In PASTE, 2001.
16. M. Hind, M. Burke, P. Carini, and J.-D. Choi. Interprocedural pointer alias analysis. TOPLAS, 21(4):848-894, 1999.
17. J. E. Hopcroft. An nlogn algorithm for minimizing the states of a finite automaton. The Theory of Machines and Computations, pages 189-196, 1971.
18. H.-S. Kim, E. M. Nystrom, and W. W. Hwu. Bottom-up and top-down context-sensitive summary-based pointer analysis. Technical report, IMPACT research group, University of Illinois. 2004.
19. W. Landi and B. G. Ryder. A safe approximation algorithm for interprocedural pointer aliasing. In PLDI, 1992.
20. C. Lattner and V. Adve. Data structure analysis: a fast and scalable contextsensitive heap analysis. Technical report, CS Dept., University of Illinois. 2003.
21. D. Liang and M. J. Harrold. Efficient points-to analysis for whole-program analysis. In FSE, 1999.
22. D. A. McAllester. On the complexity analysis of static analysis. In SAS, 1999.
23. J. Rehof. Minimal typings in atomic subtyping. In POPL, 1997.
24. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL, 1995.
25. E. Ruf. Context-insensitive alias analysis reconsidered. In PLDI, 1995.
26. B. Steensgaard. Points-to analysis in almost linear time. In POPL, 1996.
27. R. P. Wilson and M. S. Lam. Efficient context-sensitive pointer analysis for C programs. In PLDI, 1995.