Program analysis concerns static techniques for computing reliable approximate information
about the dynamic behaviour of programs. Applications include compilers (for code …

The subject of this article is flow-and context-insensitive pointer analysis. We present a novel
approach for precisely modelling struct variables and indirect function calls. Our method …

Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each
transition is labeled with a value, and the goal is to determine the meet-over-all-paths value …

We apply linear algebra techniques to precise interprocedural dataflow analysis.
Specifically, we describe analyses that determine for each program point identities that are …

We present a high-level survey of state-of-the-art alias analyses for object-oriented
programs, based on a years-long effort develo** industrial-strength static analyses for …

Existing whole-program context-sensitive pointer analysis frameworks for Java, which were
open-sourced over one decade ago, were designed and implemented to support only …

We present a new method for solving the fixed point equations that appear in the static
analysis of programs by abstract interpretation. We introduce and analyze a policy iteration …

We propose lazy propagation as a technique for flow-and context-sensitive interprocedural
analysis of programs with objects and first-class functions where transfer functions may not …

This paper presents and evaluates a number of techniques to improve the execution time of
interprocedural pointer analysis in the context of C programs. The analysis is formulated as …

While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly
cubic, the analysis seems to scale better on real-world codes. We examine algorithmic …