%O Report 
%F LIES:2011:INRIA-00606961:1
%A Lakhdar-Chaouch, Lies
%A Jeannet, Bertrand
%A Girault, Alain
%T Widening with Thresholds for Programs with Complex Control Graphs
%N 0
%P 0-0
%I INRIA
%X {The precision of an analysis based on abstract interpretation does not only depend on the expressiveness of the abstract domain, but also on the way fixpoint equations are solved: exact solving is often not possible. The traditional solution is to solve iteratively abstract fixpoint equations, using extrapolation with a widening operator to make the iterations converge. Unfortunately, the extrapolation too often loses crucial information for the analysis goal. A classical technique for improving the precision is ''widening with thresholds'', which bounds the extrapolation. Its benefit strongly depends on the choice of relevant thresholds. In this paper we propose a semantic-based technique for automatically inferring such thresholds, which applies to any control graph, be it intraprocedural, interprocedural or concurrent, without specific assumptions on the abstract domain. Despite its technical simplicity, our technique is able to infer the relevant thresholds in many practical cases.}
%U http://hal.inria.fr/inria-00606961/PDF/RR-7673.pdf
%8 July
%D 2011
%K Static Analysis
%K  Abstract Interpretation
%K  Numerical and Symbolic Abstract Domains
%K  Convex Polyhedra
%K  Semantic Equation Solving
%K  Widening