Upper adjoints for fast inter-procedural variable equalities

Markus Müller-Olm, Helmut Seidl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings
Pages178-192
Number of pages15
DOIs
StatePublished - 2008
Event17th European Symposium on Programming, ESOP 2008 - Budapest, Hungary
Duration: 29 Mar 20086 Apr 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4960 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th European Symposium on Programming, ESOP 2008
Country/TerritoryHungary
CityBudapest
Period29/03/086/04/08

Fingerprint

Dive into the research topics of 'Upper adjoints for fast inter-procedural variable equalities'. Together they form a unique fingerprint.

Cite this