Upper Adjoints for Fast Inter-procedural Variable Equalities

We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm infers variable-variable equalities in addition to equalities between variables and constants. Like copy constant propagation, it onstant and copying assignments but abstracts more complex assignments ds. The algorithm is based on the observation that, for the abstract lattice of consistent equivalence relations, the upper adjoints of summary functions can be represented much more succinctly than summary functions themselves.

• Type: Conference
• Year: 2008
• Where: ESOP
• Authors: Markus Müller-Olm, Helmut Seidl
• Keywords: Copy Constant Propagation, ESOP 2008, Polynomial-time Algorithm, Programming Languages, Summary Functions