Combining Range and Inequality Information for Pointer Disambiguation - Archive ouverte HAL Access content directly
Journal Articles Science of Computer Programming Year : 2017

Combining Range and Inequality Information for Pointer Disambiguation


Pentagons is an abstract domain invented by Logozzo and Fähndrich to validate array accesses in low-level programming languages. This algebraic structure provides a cheap “less-than check”, which builds a partial order between the integer variables used in a program. In this paper, we show how we have used the ideas available in Pentagons to design and implement a novel alias analysis. With this new algorithm, we are able to disambiguate pointers with off- sets, that commonly occur in C programs, in a precise and efficient way. Together with this new abstract domain we describe several implementation decisions that let us produce a practical pointer disambiguation algorithm on top of the LLVM compiler. Our alias analysis is able to handle programs as large as SPEC CPU2006’s gcc in a few minutes. Furthermore, it improves on LLVM’s industrial quality analyses. As an extreme example, we have observed a 4x improvement when analyzing SPEC’s lbm.
Fichier principal
Vignette du fichier
scp17_pointers_hal_authorversion.pdf (1.01 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01625402 , version 1 (27-10-2017)


  • HAL Id : hal-01625402 , version 1


Maroua Maalej, Vitor Paisante, Fernando Magno Quintão Pereira, Laure Gonnord. Combining Range and Inequality Information for Pointer Disambiguation. Science of Computer Programming, 2017. ⟨hal-01625402⟩
396 View
255 Download


Gmail Facebook X LinkedIn More