Fast and accurate flow-insensitive points-to analysis

Abstract

There are many different approaches to computing points-to information. This article addresses techniques for flow- and context-insensitive interprocedural analysis of stack-based storage. The article particularly makes two contribution in this area. The first contribution is a set of experiments that explore the trade-offs between techniques previously defined by Lars Andersen and Bjarne Steensgaard, and the other is the definition of two new algorithms.