Approximating the Transitive Closure of a Boolean-Affine Relation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Approximating the Transitive Closure of a Boolean-Affine Relation

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.
No file

Dates and versions

hal-00761491 , version 1 (05-12-2012)

Identifiers

  • HAL Id : hal-00761491 , version 1

Cite

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⟩
63 View
0 Download

Share

Gmail Facebook X LinkedIn More