Demand-driven context-sensitive alias analysis for Java

2011 International Symposium on Software Testing and Analysis, ISSTA 2011 - Proceedings

Volumn , Issue , 2011, Pages 155-165

  Yan, Dacong ^a   Xu, Guoqing ^a   Rountev, Atanas ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

alias analysis; context sensitivity; demand driven

Indexed keywords

ALIAS ANALYSIS; CALL GRAPHS; CALLING CONTEXTS; CONTEXT SENSITIVITY; CONTEXT-SENSITIVE; DEMAND-DRIVEN; FIELD SENSITIVITY; POINTS-TO ANALYSIS; PROGRAM UNDERSTANDING; REACHABILITY; REACHABILITY PROBLEM; REFERENCE VALUES; TIME BUDGET;

COMPUTER SOFTWARE SELECTION AND EVALUATION; JAVA PROGRAMMING LANGUAGE; SOFTWARE TESTING; VERIFICATION;

CONTEXT FREE LANGUAGES;

EID: 80051922052     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001420.2001440     Document Type: Conference Paper

References (33)

1. R. Chatterjee, B. G. Ryder, and W. Landi. Relevant context inference. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 133-146, 1999.
2. S. Guyer and C. Lin. Client-driven pointer analysis. In Static Analysis Symposium, pages 214-236, 2003.
3. N. Heintze and O. Tardieu. Demand-driven pointer analysis. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 24-34, 2001.
4. M. Hind. Pointer analysis: Haven't we solved this problem yet? In ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 54-61, 2001.
5. S. Horwitz, T. Reps, and M. Sagiv. Demand interprocedural dataflow analysis. In ACM SIGSOFT International Symposium on the Foundations of Software Engineering, pages 104-115, 1995.
6. J. Kodumal and A. Aiken. The set constraint/CFL reachability connection in practice. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 207-218, 2004.
7. J. Kodumal and A. Aiken. Regularly annotated set constraints. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 331-341, 2007.
8. O. Lhoták. Program Analysis using Binary Decision Diagrams. PhD thesis, McGill University, 2006.
9. O. Lhoták and L. Hendren. Scaling Java points-to analysis using Spark. In International Conference on Compiler Construction, pages 153-169, 2003.
10. O. Lhoták and L. Hendren. Context-sensitive points-to analysis: Is it worth it? In International Conference on Compiler Construction, pages 47-64, 2006.
11. Y. Liu and A. Milanova. Static analysis for inference of explicit information flow. In ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 50-56, 2008.
12. D. Melski and T. Reps. Interconvertibility of a class of set constraints and context-free-language reachability. Theoretical Computer Science, 248:29-98, 2000.
13. A. Milanova, A. Rountev, and B. G. Ryder. Parameterized object sensitivity for points-to analysis for Java. ACM Transactions on Software Engineering and Methodology, 14(1):1-41, 2005.
14. Paddle Framework, www.sable.mcgill.ca/paddle.
15. J. Rehof and M. Fähndrich. Type-based flow analysis: From polymorphic subtyping to CFL-reachability. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 54-66, 2001.
16. T. Reps. Solving demand versions of interprocedural analysis problems. In International Conference on Compiler Construction, pages 389-403, 1994.
17. T. Reps. Shape analysis as a generalized path problem. In ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 1-11, 1995.
18. T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11-12):701-726, 1998. (Pubitemid 128411141)
19. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 49-61, 1995.
20. T. Reps, S. Horwitz, M. Sagiv, and G. Rosay. Speeding up slicing. In ACM SIGSOFT International Symposium on the Foundations of Software Engineering, pages 11-20, 1994.
21. A. Rountev, S. Kagan, and T. Marlowe. Interprocedural dataflow analysis in the presence of large libraries. In International Conference on Compiler Construction, pages 2-16, 2006.
22. A. Rountev and B. G. Ryder. Points-to and side-effect analyses for programs built with precompiled libraries. In International Conference on Compiler Construction, pages 20-36, 2001.
23. A. Rountev, M. Sharp, and G. Xu. IDE dataflow analysis in the presence of large object-oriented libraries. In International Conference on Compiler Construction, pages 53-68, 2008.
24. B. G. Ryder. Dimensions of precision in reference analysis of object-oriented programming languages. In International Conference on Compiler Construction, pages 126-137, 2003.
25. Y. Smaragdakis, M. Bravenboer, and O. Lhotak. Pick your contexts well: understanding object-sensitivity. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 17-30, 2011.
26. M. Sridharan and R. Bodik. Refinement-based context-sensitive points-to analysis for Java. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 387-400, 2006.
27. M. Sridharan, D. Gopan, L. Shan, and R. Bodik. Demand-driven points-to analysis for Java. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 59-76, 2005.
28. R. Vallée-Rai, E. Gagnon, L. Hendren, P. Lam, P. Pominville, and V. Sundaresan. Optimizing Java bytecode using the Soot framework: Is it feasible? In International Conference on Compiler Construction, pages 18-34, 2000.
29. J. Whaley and M. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 131-144, 2004.
30. J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java programs. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, pages 187-206, 1999.
31. R. Wilson and M. Lam. Efficient context-sensitive pointer analysis for C programs. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 1-12, 1995.
32. G. Xu, A. Rountev, and M. Sridharan. Scaling CFL-reachability-based points-to analysis using context-sensitive must-not-alias analysis. In European Conference on Object-Oriented Programming, pages 98-122, 2009.
33. X. Zheng and R. Rugina. Demand-driven alias analysis for C. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 197-208, 2008.