Fast Interprocedural Linear Two Variable Equalities

In this paper we provide an interprocedural analysis of linear two variable equalities. In contrast to the corresponding approach based on full linear algebra, the novel algorithm saves a factor of k 4 in the worst-case complexity, where k is the number of variables. We also indicate how the practical runtime can be further reduced significantly. The analysis can be applied, e.g., for register coalescing, for identifying local variables and for an analysis of array index expressions