We present lookahead widening, a novel technique for using existing widening and narrowing operators to improve the precision of static analysis. This technique is both self-contained and fully-automatic in the sense that it does not rely on separate analyzes or human involvement. We show how to integrate lookahead widening into existing analyzers with minimal effort. Experimental results indicate that the technique is able to achieve sizable precision improvements at reasonable costs
International audienceWe show that abstract interpretation-based static program analysis can be made...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...
In the context of static analysis via abstract interpretation, convex polyhedra constitute the most ...
This paper proposes a counterexample-guided narrowing approach、which combines static analysis and te...
Some codes require computations to use fewer bits of precision than are normal for the target machin...
Abstract Interpretation, one of the most applied techniques for semantics based static analysis of s...
Abstract Interpretation, one of the most applied techniques for semantics based static analysis of s...
FuncTion is a static analyzer designed for proving conditional termination of C programs by means of...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
Abstract. Linear Relation Analysis [CH78,Hal79] is one of the first, but still one of the most power...
Abstract. The static determination of approximated values of string expressions has many potential a...
Online version Dec 2009, paper version 2010.International audienceWe consider the problem of formali...
International audienceTwo classical sources of imprecision in static analysis by abstract interpreta...
Abstract. We present a parameterized widening operator that determines the control-flow sensitivity ...
International audienceWe show that abstract interpretation-based static program analysis can be made...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...
In the context of static analysis via abstract interpretation, convex polyhedra constitute the most ...
This paper proposes a counterexample-guided narrowing approach、which combines static analysis and te...
Some codes require computations to use fewer bits of precision than are normal for the target machin...
Abstract Interpretation, one of the most applied techniques for semantics based static analysis of s...
Abstract Interpretation, one of the most applied techniques for semantics based static analysis of s...
FuncTion is a static analyzer designed for proving conditional termination of C programs by means of...
AbstractStatic analysis by abstract interpretation aims at automatically proving properties of compu...
Abstract. Linear Relation Analysis [CH78,Hal79] is one of the first, but still one of the most power...
Abstract. The static determination of approximated values of string expressions has many potential a...
Online version Dec 2009, paper version 2010.International audienceWe consider the problem of formali...
International audienceTwo classical sources of imprecision in static analysis by abstract interpreta...
Abstract. We present a parameterized widening operator that determines the control-flow sensitivity ...
International audienceWe show that abstract interpretation-based static program analysis can be made...
International audienceStatic analysis by abstract interpretation aims at automatically proving prope...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...