Sciweavers

HIPEAC
2005
Springer

Induction Variable Analysis with Delayed Abstractions

13 years 8 months ago
Induction Variable Analysis with Delayed Abstractions
ions Sebastian Pop 1 , Albert Cohen 2 , and Georges-Andr´e Silber 1 1 CRI, Mines Paris, Fontainebleau, France 2 ALCHEMY group, INRIA Futurs, Orsay, France Abstract. This paper presents the design of an induction variable analyzer suitable for the analysis of typed, low-level, three address representations in SSA form. At the heart of our analyzer is a new algorithm recognizing scalar evolutions. We define a representation called trees of ces that is able to capture different levels of abstractions: from the finer level that is a subset of the SSA representation restricted to arithmetic operations on scalar variables, to the coarser levels such as ution envelopes that abstract sets of possible evolutions in loops. Unlike previous work, our algorithm tracks induction variables without prior classification of a few evolution patterns: different levels of abstraction can be obtained on demand. The low complexity of the algorithm fits the constraints of a production compiler as illus...
Sebastian Pop, Albert Cohen, Georges-André
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where HIPEAC
Authors Sebastian Pop, Albert Cohen, Georges-André Silber
Comments (0)