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 …

Interprocedural analyses enable optimizing compilers to more precisely model the effects of
non-inlined procedure calls, potentially resulting in substantial increases in application …

A large number of call graph construction algorithms for object-oriented and functional
languages have been proposed, each embodying different tradeoffs between analysis cost …

Propagation-based call graph construction algorithms have been studied intensively in the
199Os, and differ primarily in the number of sets that are used to approximate run-time …

This expository paper simplifies and clarifies Steffen's depiction of data flow analysis (dfa) as
model checking: By employing abstract interpretation (ai) to generate program traces and by …

We show that standard formulations of intersection type systems are unsound in the
presence of computational effects, and propose a solution similar to the value restriction for …

Recent years have seen increasing interest in systems that reason about and manipulate
executable code. Such systems can generally benefit from information about aliasing …

A number of program-analysis problems can be tackled by transforming them into certain
kinds of graph-reachability problems in labeled directed graphs. The edge labels can be …

We propose static program analysis techniques for identifying the impact of relational
database schema changes upon object-oriented applications. We use dataflow analysis to …