Fast and Accurate Flow-Insensitive Points-To Analysis

Marc Shapiro and Susan Horwitz
University of Wisconsin

In order to analyze a program that involves pointers, it is necessary to have (safe) information about what each pointer points to. There are many different approaches to computing points-to information. This paper addresses techniques for flow- and context-insensitive interprocedural analysis of stack-based storage.

The paper makes two contributions to work in this area:

(Click here to access the paper.)