From jlu@cs.rice.edu Tue Oct  1 11:00:35 1996
Received: from athene.cs.rice.edu (athene.cs.rice.edu [128.42.1.200]) by cs.rice.edu (8.7.1/8.7.1) with ESMTP id LAA26295; Tue, 1 Oct 1996 11:00:35 -0500 (CDT)
From: John Lu <jlu@cs.rice.edu>
Received: (from jlu@localhost) by athene.cs.rice.edu (8.7.3/8.7.3) id LAA22032; Tue, 1 Oct 1996 11:00:34 -0500 (CDT)
Date: Tue, 1 Oct 1996 11:00:34 -0500 (CDT)
Message-Id: <199610011600.LAA22032@athene.cs.rice.edu>
To: crpc.tr@cs.rice.edu, tlc@cs.rice.edu
Subject: abstract
Status: RO


Interprocedural pointer analysis provides information on the
values pointer variables may have at various points in a
program.  It is especially useful in languages like C, where
pointers are extensively used.  This analysis does not improve
code directly but is used by other optimizations.

This paper presents a framework in which to perform
pointer analysis.  Basic questions that any pointer analyzer
must answer are discussed, and answers to these questions
are developed.  A working pointer analyzer is presented with
performance results given for the analyzer.  The effect
of the analyzer on the running time of various programs is
also shown.