Approximating the Transitive Closure of a Boolean-Affine Relation

International audienceBoolean 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