Affiliation:
1. Technische Universität München, Garching, Germany
2. Westfälische Wilhelms-Universität Münster, Germany
Abstract
In this article we provide an interprocedural analysis of linear two-variable equalities. The novel algorithm has a worst-case complexity of 𝒪(
n
⋅
k
4
), where
k
is the number of variables and
n
is the program size. Thus, it saves a factor of
k
4
in comparison to a related algorithm based on full linear algebra. We also indicate how the practical runtime can be further reduced significantly. The analysis can be applied, for example, for register coalescing, for identifying local variables and thus for interprocedurally observing stack pointer modifications as well as for an analysis of array index expressions, when analyzing low-level code.
Publisher
Association for Computing Machinery (ACM)
Reference20 articles.
1. Detecting equality of variables in programs
2. Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems;Fecht C.;Nord. J. Comput.,1998
3. Iterated register coalescing
4. Precise interprocedural dataflow analysis via graph reachability
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献