Skip to Main content Skip to Navigation

Combining Range and Inequality Information for Pointer Disambiguation

Abstract : 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. This new algorithm lets us disambiguate pointers with offsets, so common in C-style pointer arithmetics, in a precise and efficient way. Together with this new abstract domain we describe several implementation decisions that lets 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’s gcc in a few minutes. Furthermore, we have been able to improve the percentage of pairs of pointers disambiguated, when compared to LLVM’s built-in analyses, by a four-fold factor in some benchmarks.
Document type :
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download
Contributor : Maroua Maalej <>
Submitted on : Monday, January 9, 2017 - 4:28:48 PM
Last modification on : Tuesday, December 24, 2019 - 9:16:08 AM
Long-term archiving on: : Monday, April 10, 2017 - 1:12:32 PM


Files produced by the author(s)


  • HAL Id : hal-01429777, version 1


Maroua Maalej, Vitor Paisante, Fernando Magno Quintão Pereira, Laure Gonnord. Combining Range and Inequality Information for Pointer Disambiguation. [Research Report] RR-9009, ENS Lyon; CNRS; INRIA. 2016. ⟨hal-01429777v1⟩



Record views


Files downloads