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 …

We describe, implement and benchmark EigenCFA, an algorithm for accelerating higher-
order control-flow analysis (specifically, 0CFA) with a GPU. Ultimately, our program …

The model checking of higher-order recursion schemes, aka. higher-order model checking,
has recently been applied to automated verification of higher-order programs. Despite its …

The flexibility of dynamically typed languages such as JavaScript, Python, Ruby, and
Scheme comes at the cost of run-time type checks. Some of these checks can be eliminated …

The model checking of higher-order recursion schemes (higher-order model checking for
short) has been actively studied in the last decade, and has seen significant progress in both …

Abstract interpretation is an efficient means for approximating program behaviors before run-
time. It can be used as the basis for a number of different useful techniques in static analysis …

This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis
problems in higher-order programming languages. We give exact characterizations of the …

Inclusion-based (ie, Andersen-style) points-to analysis is a fundamental static analysis
problem. The seminal work of Andersen gave a worst-case cubic $ O (n^ 3) $ time points-to …

We describe an approach to exploring polyvariance in abstract interpretations by exposing
the allocation of abstract bindings as an analysis parameter. This allocation policy is a …

In higher order settings, control-flow analysis aims to model the propagation of both data
and control by finitely approximating program behaviors across all possible executions. The …