Two classical sources of imprecision in static analysis by abstract inter-pretation are widening and merge operations. Merge operations can be done away by distinguishing paths, as in trace partitioning, at the expense of enu-merating an exponential number of paths. In this article, we describe how to avoid such systematic exploration by focusing on a single path at a time, designated by SMT-solving. Our method combines well with acceleration techniques, thus doing away with widenings as well in some cases. We illustrate it over the well-known domain of convex polyhedra.
Static analysis by abstract interpretation aims at automatically proving properties of computer prog...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
summary:The problem of utilizing facet reflections to bring a point outside of a convex polytope to ...
International audienceTwo classical sources of imprecision in static analysis by abstract interpreta...
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...
Conference of 14th International Conference on Verification, Model Checking, and Abstract Interpreta...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...
AbstractNumerical static program analyses by abstract interpretation, e.g., the problem of inferring...
We consider the problem of computing numerical invariants of programs by abstract interpretation. Ou...
AbstractIn static analysis by abstract interpretation, one often uses widening operators in order to...
This report features an introduction to lattice- and fixpoint theory and a survey of methods and re...
We present an iterative technique in which model checking and static analysis are combined to verify...
We present a very simple, yet general algorithm for computing simultaneous, minimum fixed-points of...
To reduce the false positives of static analysis, many tools collect path constraints and integrate ...
Static analysis by abstract interpretation aims at automatically proving properties of computer prog...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
summary:The problem of utilizing facet reflections to bring a point outside of a convex polytope to ...
International audienceTwo classical sources of imprecision in static analysis by abstract interpreta...
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...
Conference of 14th International Conference on Verification, Model Checking, and Abstract Interpreta...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...
AbstractNumerical static program analyses by abstract interpretation, e.g., the problem of inferring...
We consider the problem of computing numerical invariants of programs by abstract interpretation. Ou...
AbstractIn static analysis by abstract interpretation, one often uses widening operators in order to...
This report features an introduction to lattice- and fixpoint theory and a survey of methods and re...
We present an iterative technique in which model checking and static analysis are combined to verify...
We present a very simple, yet general algorithm for computing simultaneous, minimum fixed-points of...
To reduce the false positives of static analysis, many tools collect path constraints and integrate ...
Static analysis by abstract interpretation aims at automatically proving properties of computer prog...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
summary:The problem of utilizing facet reflections to bring a point outside of a convex polytope to ...