# Abstract Acceleration of General Linear Loops

* Auteur correspondant
1 POP ART - Programming languages, Operating Systems, Parallelism, and Aspects for Real-Time
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We present abstract acceleration techniques for computing loop invariants for numerical programs with linear assignments and conditionals. Whereas abstract interpretation techniques typically over-approximate the set of reachable states iteratively, abstract acceleration captures the effect of the loop with a single, non-iterative transfer function applied to the initial states at the loop head. In contrast to previous acceleration techniques, our approach applies to any linear loop without restrictions. Its novelty lies in the use of the Jordan normal form decomposition of the loop body to derive symbolic expressions for the entries of the matrix modeling the effect of n>=0 iterations of the loop. The entries of such a matrix depend on $n$ through complex polynomial, exponential and trigonometric functions. Therefore, we introduces an abstract domain for matrices that captures the linear inequality relations between these complex expressions. This results in an abstract matrix for describing the fixpoint semantics of the loop. Our approach integrates smoothly into standard abstract interpreters and can handle programs with nested loops and loops containing conditional branches. We evaluate it over small but complex loops that are commonly found in control software, comparing it with other tools for computing linear loop invariants. The loops in our benchmarks typically exhibit polynomial, exponential and oscillatory behaviors that present challenges to existing approaches. Our approach finds non-trivial invariants to prove useful bounds on the values of variables for such loops, clearly outperforming the existing approaches in terms of precision while exhibiting good performance.
Type de document :
Communication dans un congrès
Principles of Programming Languages, POPL, Jan 2014, San Diego, United States. ACM, pp.529-540, 2013, The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA. 〈10.1145/2535838.2535843〉

https://hal.inria.fr/hal-00932342
Contributeur : Bertrand Jeannet <>
Soumis le : jeudi 16 janvier 2014 - 17:14:10
Dernière modification le : vendredi 12 octobre 2018 - 01:18:06
Document(s) archivé(s) le : jeudi 17 avril 2014 - 09:50:20

### Fichiers

p529-jeannet.pdf
Fichiers éditeurs autorisés sur une archive ouverte

### Citation

Bertrand Jeannet, Peter Schrammel, Sriram Sankaranarayanan. Abstract Acceleration of General Linear Loops. Principles of Programming Languages, POPL, Jan 2014, San Diego, United States. ACM, pp.529-540, 2013, The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA. 〈10.1145/2535838.2535843〉. 〈hal-00932342〉

### Métriques

Consultations de la notice

## 679

Téléchargements de fichiers