This paper describes an empirical comparison of four
context-insensitive pointer alias analysis algorithms that use varying
degrees of flow-sensitivity: a flow-insensitive algorithm that tracks
variables whose addresses were taken and stored; a flow-insensitive
algorithm that computes a solution for each function; a variant of
this algorithm that uses precomputed kill information; and a
flow-sensitive algorithm. In addition to contrasting the precision
and efficiency of these analyses, we describe implementation
techniques and quantify their analysis-time speed-up. Lastly, it
illustrates the object-oriented approach used in the design of the
system, which provides a natural example of multiple inheritance.
By: Michael Hind and Anthony Pioli
Published in: RC21251 in 1998
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .