Abstract. Linear Relation Analysis [CH78,Hal79] is one of the first, but still one of the most powerful, abstract interpretations working in an infinite lattice. As such, it makes use of a widening operator to en-force the convergence of fixpoint computations. While the approximation due to widening can be arbitrarily refined by delaying the application of widening, the analysis quickly becomes too expensive with the increase of delay. Previous attempts at improving the precision of widening are not completely satisfactory, since none of them is guaranteed to improve the precision of the result, and they can nevertheless increase the cost of the analysis. In this paper, we investigate an improvement of Linear Relation Analysis consisting in...
The use of infinite abstract domains with widening and narrowing for accelerating the convergence of...
We present lookahead widening, a novel technique for using existing widening and narrowing operator...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...
International audienceLinear Relation Analysis [CH78, Hal79] is one of the first, but still one of t...
{Linear Relation Analysis~\cite{cousot78,halbwach79} is now a classical abstract interpretation base...
Linear relation analysis is a classical abstract interpretation based on an over-approximation of re...
Linear relation analysis is a classical abstract interpretation based on an over-approximation of re...
Author version : http://hal.inria.fr/hal-00787212/enInternational audienceAbstract acceleration is a...
This work deals with verification of safety properties of programs, and more specifically with numer...
In the context of static analysis via abstract interpretation, convex polyhedra constitute the most ...
AbstractIn the context of static analysis via abstract interpretation, convex polyhedra constitute t...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...
Online version Dec 2009, paper version 2010.International audienceWe consider the problem of formali...
International audienceLinear relation analysis (polyhedral analysis), devoted to discovering linear ...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
The use of infinite abstract domains with widening and narrowing for accelerating the convergence of...
We present lookahead widening, a novel technique for using existing widening and narrowing operator...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...
International audienceLinear Relation Analysis [CH78, Hal79] is one of the first, but still one of t...
{Linear Relation Analysis~\cite{cousot78,halbwach79} is now a classical abstract interpretation base...
Linear relation analysis is a classical abstract interpretation based on an over-approximation of re...
Linear relation analysis is a classical abstract interpretation based on an over-approximation of re...
Author version : http://hal.inria.fr/hal-00787212/enInternational audienceAbstract acceleration is a...
This work deals with verification of safety properties of programs, and more specifically with numer...
In the context of static analysis via abstract interpretation, convex polyhedra constitute the most ...
AbstractIn the context of static analysis via abstract interpretation, convex polyhedra constitute t...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...
Online version Dec 2009, paper version 2010.International audienceWe consider the problem of formali...
International audienceLinear relation analysis (polyhedral analysis), devoted to discovering linear ...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
The use of infinite abstract domains with widening and narrowing for accelerating the convergence of...
We present lookahead widening, a novel technique for using existing widening and narrowing operator...
We present abstract acceleration techniques for computing loop in-variants for numerical programs wi...