Static single assignment form (SSA) is a popular program intermediate representation (IR)
for static analysis. SSA programs differ from equivalent control flow graph (CFG) programs …

Tennenbaum's data flow analysis based formulation of type inferencing is termed
bidirectional in the “Dragon Book”; however, it fails to qualify as a formal data flow framework …

Partial redundancy elimination (PRE) subsumes the classical optimizations of loop invariant
movement and common subexpression elimination. The original formulation of PRE …

We give a uniform type-systematic account of a number of optimizations and the underlying
analyses for a bytecode-like stack-based low-level language, including analysis soundness …

Demand-driven methods for program analysis have primarily been viewed as efficient
algorithms for computing the same information as the corresponding exhaustive methods …

Data-flow analysis is a common technique for gathering program information for use in
program transformations such as register allocation, dead-code elimination, common …

Type inference can be expressed as a bidirectional data flow problem. In this paper we
show how to perform type inference using sparse data flow analysis on the static single …

A demand-driven approach to program analysis have been viewed as efficient algorithms to
compute only the information required to serve a target demand. In contrast, an exhaustive …

Partial Redundancy Elimination (PRE) is a ubiquitous optimization used by compilers to
remove repeated computations from programs. Speculative PRE (SPRE), which uses …

We show that a wide class of bidirectional data-flow analyses and program optimizations
based on them admit declarative descriptions in the form of type systems. The salient feature …