This talk will describe how a wide variety of program-analysis problems can be solved by transforming them to special kinds of graph-reachability problems. Some of the problems that are amenable to this treatment include:
Some techniques that go beyond pure graph reachability will also be described, and experimental results from several studies of C programs will be presented.
The talk is based on joint work with Susan Horwitz, Mooly Sagiv, Genevieve Rosay, and Manuvir Das. Various papers on the material covered are available over the World Wide Web at URL http://www.cs.wisc.edu/~reps.