We present a survey of control-flow analysis of functional programs, which has been the
subject of extensive investigation throughout the past 30 years. Analyses of the control flow …

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

Shape analysis concerns the problem of determining" shape invariants" for programs that
perform destructive updating on dynamically allocated storage. This article presents a …

Many program analyses require statically inferring the possible values of composite types.
However, current approaches either do not account for correlations between object fields or …

This paper reports on the design, implementation, and empirical results of a new method for
dealing with the aliasing problem in C. The method is based on approximating the points-to …

Growing interest in ambitious multiple-issue machines and heavily-pipelined machines
requires a careful examination of how much instruction-level parallelism exists in typical …

Linearisability is a key correctness criterion for concurrent data structures, ensuring that
each history of the concurrent object under consideration is consistent with respect to a …

High-level languages could be optimized significantly if compilers could determine
automatically how pointers and heap allocated structures are used. Setter knowledge of …

During execution, when two or more names exist for the same location at some program
point, we call them aliases. In a language which allows arbitrary pointers, the problem of …

Existing methods for alias analysis of recursive pointer data structures are based on two
approximation techniques: k-limiting, and store-based (or equivalently location or region …