This new, expanded textbook describes all phases of a modern compiler: lexical analysis,
parsing, abstract syntax, semantic actions, intermediate representations, instruction …

Virtual functions make code easier for programmers to reuse but also make it harder for
compilers to analyze. We investigate the ability of three static analysis algorithms to improve …

Heap data is potentially unbounded and seemingly arbitrary. Hence, unlike stack and static
data, heap data cannot be abstracted in terms of a fixed set of program variables. This …

The goal of points-to analysis for Java is to determine the set of objects pointed to by a
reference variable or a reference object field. We present object sensitivity, a new form of …

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

This paper addresses the problem of resolving virtual method and interface calls in Java
bytecode. The main focus is on a new practical technique that can be used to analyze large …

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

The goal of points-to analysis for Java is to determine the set of objects pointed to by a
reference variable or a reference objet field. Improving the precision of practical points-to …

This paper evaluates three alias analyses based on programming language types. The first
analysis uses type compatibility to determine aliases. The second extends the first by using …

Relevant context inference (RCI) is a modular technique for flow-and context-sensitive data-
flow analysis of statically typed object-oriented programming languages such as C++ and …