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. 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.
Type de document :
Article dans une revue
Science of Computer Programming, Elsevier, 2017
Liste complète des métadonnées

Littérature citée [43 références]  Voir  Masquer  Télécharger
Contributeur : Laure Gonnord <>
Soumis le : vendredi 27 octobre 2017 - 15:11:48
Dernière modification le : dimanche 17 mars 2019 - 08:58:05
Document(s) archivé(s) le : dimanche 28 janvier 2018 - 15:00:29


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01625402, version 1



Maroua Maalej, Vitor Paisante, Fernando Magno Quintao Pereira, Laure Gonnord. Combining Range and Inequality Information for Pointer Disambiguation. Science of Computer Programming, Elsevier, 2017. 〈hal-01625402〉



Consultations de la notice


Téléchargements de fichiers