Demand-driven points-to analysis for Java

Sridharan, Manu; GopanDenis,; ShanLexin,; BodikRastislav,

doi:10.1145/1103845.1094817

Cited by 59 publications

(86 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We introduce the state-of-the-art points-to analysis for Java formulated in terms of CFLreachability [26,27,28,36] which uses Spark's PAGs [17] as the program representation. In Section 2.1, we consider the syntax of PAGs and how to represent a Java example as a PAG.…”

Section: Cfl-reachabilitymentioning

confidence: 99%

See 1 more Smart Citation

An Incremental Points-to Analysis with CFL-Reachability

Lü

Shang

Xie

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Developing scalable and precise points-to analyses is increasingly important for analysing and optimising object-oriented programs where pointers are used pervasively. An incremental analysis for a program updates the existing analysis information after program changes to avoid reanalysing it from scratch. This can be efficiently deployed in software development environments where code changes are often small and frequent. This paper presents an incremental approach for demand-driven context-sensitive points-to analyses based on ContextFree Language (CFL) reachability. By tracing the CFL-reachable paths traversed in computing points-to sets, we can precisely identify and recompute on demand only the points-to sets affected by the program changes made. Combined with a flexible policy for controlling the granularity of traces, our analysis achieves significant speedups with little space overhead over reanalysis from scratch when evaluated with a null dereferencing client using 14 Java benchmarks.

show abstract

Section: Cfl-reachabilitymentioning

confidence: 99%

“…Existing solutions address the performance issue from several directions, by using refinement [27,28], (whole-program) pre-analysis [36], ad hoc caching [41], and procedural summarisation [26,25,37]. In this paper, we tackle this issue from a different angle.…”

Section: Introductionmentioning

confidence: 99%

An Incremental Points-to Analysis with CFL-Reachability

Lü

Shang

Xie

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Field-based analysis can also be more efficient than field-sensitive analysis, since there is less information to track about the program. Indeed, our current implementation of JQual (Section 4) typically runs out of memory when trying to perform full fieldsensitive analysis on our larger benchmark programs, and efficient field-sensitive analysis is an active area of research [27,31,43,44,48].…”

Section: Field-sensitivitymentioning

confidence: 99%

“…In this approach, we reduce context-sensitive inference to the problem of context-free language (CFL) reachability on a constraint graph. As is well-known, context-sensitive analysis can be more expensive than context-insensitive analysis, but CFL reachability has proved to be very scalable in practice [15,36,43,44].…”

Section: Context-sensitivitymentioning

confidence: 99%

See 1 more Smart Citation

Type qualifier inference for java

Greenfieldboyce

Foster

2007

Proceedings of the 22nd Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications

View full text Add to dashboard Cite

Java's type system provides programmers with strong guarantees of type and memory safety, but there are many important properties not captured by standard Java types. We describe JQual, a tool that adds user-defined type qualifiers to Java, allowing programmers to quickly and easily incorporate extra lightweight, application-specific type checking into their programs. JQual provides type qualifier inference, so that programmers need only add a few key qualifier annotations to their program, and then JQual infers any remaining qualifiers and checks their consistency. We explore two applications of JQual. First, we introduce opaque and enum qualifiers to track C pointers and enumerations that flow through Java code via the JNI. In our benchmarks we found that these C values are treated correctly, but there are some places where a client could potentially violate safety. Second, we introduce a readonly qualifier for annotating references that cannot be used to modify the objects they refer to. We found that JQual is able to automatically infer readonly in many places on method signatures. These results suggest that type qualifiers and type qualifier inference are a useful addition to Java.

show abstract

Efficient online cycle detection technique combining with Steensgaard points‐to information

Liu

Nasre

2015

Softw Pract Exp

View full text Add to dashboard Cite

Summary Pointer analysis is a key static analysis during compilation. Several client analyses and transformations rely on precise pointer information to optimize programs. Therefore, it is paramount to improve the efficiency of pointer analysis. A critical piece of an inclusion‐based pointer analysis is online cycle detection. The efficiency of pointer analysis is significantly influenced by the efficacy of detecting cycles. Existing approaches perform poorly when they guess cycle formation in the constraint graph. Thus, the number of false cycle‐detection triggers of the state‐of‐the‐art methods is considerably high (over 99% on Standard Performance Evaluation Corporation (SPEC) benchmarks). In this paper, we propose bootstrapping as a way to improve cycle detection predictability of pointer analysis. The main idea is to run a sequence of increasingly precise analyses to feed into the next more precise analysis to improve the efficiency of the latter analysis. In this process, we develop a new notion of pointer equivalence called constraint equivalence. Using Steensgaard's fast unification algorithm as the bootstrap, we devise a new cycle detection method for Andersen's inclusion‐based analysis. We measure the effectiveness of our approach using a suite of programs including SPEC 2000 benchmarks and two open‐source programs, and find that our method can reduce the number of false cycle detections by almost 22× compared with a state‐of‐the‐art method. This leads to an overall analysis time improvement of 18% on an average. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Demand-driven points-to analysis for Java

Cited by 59 publications

References 41 publications

An Incremental Points-to Analysis with CFL-Reachability

An Incremental Points-to Analysis with CFL-Reachability

Type qualifier inference for java

Efficient online cycle detection technique combining with Steensgaard points‐to information

Contact Info

Product

Resources

About