Fast online pointer analysis
Citations Over TimeTop 10% of 2007 papers
Abstract
Pointer analysis benefits many useful clients, such as compiler optimizations and bug finding tools. Unfortunately, common programming language features such as dynamic loading, reflection, and foreign language interfaces, make pointer analysis difficult. This article describes how to deal with these features by performing pointer analysis online during program execution. For example, dynamic loading may load code that is not available for analysis before the program starts. Only an online analysis can analyze such code, and thus support clients that optimize or find bugs in it. This article identifies all problems in performing Andersen's pointer analysis for the full Java language, presents solutions to these problems, and uses a full implementation of the solutions in a Java virtual machine for validation and performance evaluation. Our analysis is fast: On average over our benchmark suite, if the analysis recomputes points-to results upon each program change, most analysis pauses take under 0.1 seconds, and add up to 64.5 seconds.
Related Papers
- → Flow-sensitive pointer analysis for millions of lines of code(2011)112 cited
- → Refining the Pointer Analysis by Exploiting Constraints on the CFL-Paths(2013)1 cited
- → Devirtualization for static analysis with low level intermediate representation(2022)1 cited
- Understanding Uncertainty in Static Pointer Analysis(2009)