Approximating the Transitive Closure of a Boolean-Affine Relation

Paul Feautrier 1, *
* Corresponding author
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00761491
Contributor : Alain Darte <>
Submitted on : Wednesday, December 5, 2012 - 3:46:26 PM
Last modification on : Wednesday, November 20, 2019 - 2:43:14 AM

Identifiers

  • 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. ⟨hal-00761491⟩

Share

Metrics

Record views

127