Abstract Acceleration in Linear Relation Analysis

Laure Gonnord 1, 2 Peter Schrammel 3, 4
1 COMPSYS - Compilation and embedded computing systems
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
2 LIFL - DART/Émeraude
LIFL - Laboratoire d'Informatique Fondamentale de Lille
3 POP ART - Programming languages, Operating Systems, Parallelism, and Aspects for Real-Time
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Abstract acceleration is a method that computes the precise abstract effect of loops wherever possible and uses widening in the general case. Thus, it improves both the precision and the efficiency of the analysis. % This article gives a comprehensive tutorial on abstract acceleration: its origins in Presburger-based acceleration including new insights w.r.t. the linear accelerability of linear transformations, methods for simple and nested loops, recent extensions, tools and applications, and a detailed discussion of related methods and future perspectives.
Type de document :
Article dans une revue
Science of Computer Programming, Elsevier, 2014, 93, part B (125 - 153), 〈10.1016/j.scico.2013.09.016〉
Liste complète des métadonnées

Contributeur : Laure Gonnord <>
Soumis le : vendredi 25 octobre 2013 - 10:16:59
Dernière modification le : lundi 16 novembre 2015 - 01:03:24




Laure Gonnord, Peter Schrammel. Abstract Acceleration in Linear Relation Analysis. Science of Computer Programming, Elsevier, 2014, 93, part B (125 - 153), 〈10.1016/j.scico.2013.09.016〉. 〈hal-00876627〉



Consultations de la notice