In this talk we focus on the impact of pointer analysis precision on
SSA Form. We select pointer analysis algorithms ranging from a linear
variant of Steensgaard's algorithm, to exponential algorithms for
shape analysis, and compare the different variants of SSA Form that
can be computed based on the pointer analysis results of different
levels of precision. In general, the more precise the pointer
analysis, the less may-alias information needs to be established and
the more must-alias information can be established.  Encoding this
information in SSA Form allows to separate memory regions that are
potentially modified by an assignment involving pointer operations.

We compare different variants of SSA Form with focus on C/C++
programs, by using our Static Analsis Tool Integration Engine
(SATIrE), and also show how SSA information can be represented in the
SATIrE intermediate representation to accomodate different levels of
pointer analysis precision.


Static Analysis Tool Integration Engine (SATIrE) website:
http://www.complang.tuwien.ac.at/satire

Design and Philosophy of SATIrE with an illustrative example:
http://drops.dagstuhl.de/opus/volltexte/2008/1569/