We present a polynomial-time algorithm which at the extra cost of a factor (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 tracks constant and copying assignments but abstracts more complex assignments and guards. 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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Müller-Olm, M., & Seidl, H. (2008). Upper adjoints for fast inter-procedural variable equalities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4960 LNCS, pp. 178–192). https://doi.org/10.1007/978-3-540-78739-6_15
Mendeley helps you to discover research relevant for your work.