Program Analysis via Graph Reachability
Thomas Reps
This paper describes how a number of program-analysis problems can be
solved by transforming them to graph-reachability problems. Some of
the program-analysis problems that are amenable to this treatment
include program slicing, certain dataflow-analysis problems, one
version of the problem of approximating the possible ``shapes'' that
heap-allocated structures in a program can take on, and
flow-insensitive points-to analysis. Relationships between graph
reachability and other approaches to program analysis are described.
Some techniques that go beyond pure graph reachability are also
discussed.
(Click here to access the tech. report version of the paper:
PostScript,
PDF.)
University of Wisconsin