Approximating the Transitive Closure of a Boolean-Affine Relation

Paul Feautrier 1, *
* Auteur correspondant
1 COMPSYS - Compilation and embedded computing systems
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Boolean a ne relations, which combine a ne inequalities by boolean connectives are ubiquitous in all kind of static program analyzes. One of the crucial operations on such relations is transitive closure, which is closely related to the construction of loop inductive invariants. I present here a new over-approximation algorithm, which has the interest- ing property of being extendible for increased precision.
Type de document :
Communication dans un congrès
2nd International Workshop on Polyhedral Compilation Techniques (IMPACT'12), held with HIPEAC'12, Jan 2012, Paris, France. 2012
Liste complète des métadonnées

https://hal.inria.fr/hal-00761491
Contributeur : Alain Darte <>
Soumis le : mercredi 5 décembre 2012 - 15:46:26
Dernière modification le : samedi 21 avril 2018 - 01:27:09

Identifiants

  • HAL Id : hal-00761491, version 1

Collections

Citation

Paul Feautrier. Approximating the Transitive Closure of a Boolean-Affine Relation. 2nd International Workshop on Polyhedral Compilation Techniques (IMPACT'12), held with HIPEAC'12, Jan 2012, Paris, France. 2012. 〈hal-00761491〉

Partager

Métriques

Consultations de la notice

109