The finite powerset construction upgrades an abstract domain by allowing for the representation of finite disjunctions of its elements. While most of the operations on the finite powerset abstract domain are easily obtained by “lifting” the corresponding operations on the base-level domain, the problem of endowing finite powersets with a provably correct widening operator is still open. In this paper we define three generic widening methodologies for the finite powerset abstract domain. The widenings are obtained by lifting any widening operator defined on the base-level abstract domain and are parametric with respect to the specification of a few additional operators that allow all the flexibility required to tune the complexity/precision ...
AbstractA completion via Frink ideals is used to define a convex powerdomain of an arbitrary continu...
Abstract. Numeric abstract domains are widely used in program anal-yses. The simplest numeric domain...
In set theory [1], two sets are considered to have the same cardinality, if a one-to-one corresponde...
AbstractIn the context of static analysis via abstract interpretation, convex polyhedra constitute t...
In the context of static analysis via abstract interpretation, convex polyhedra constitute the most ...
We discuss the construction of proper widening operators on several weakly-relational numeric abstra...
Abstract. We discuss the construction of proper widening operators on several weakly-relational nume...
Online version Dec 2009, paper version 2010.International audienceWe consider the problem of formali...
A procedure is described for tightening domain constraints of finite domain logic programs by applyi...
In the context of the standard Cousot and Cousot framework, refinement operators that systematically...
Operators that systematically produce more precise abstract interpretations from simpler ones are in...
AbstractIn this paper we present how sweeping line techniques, which are very popular in computation...
Abstract. Automata over infinite words provide a powerful framework to solve various decision proble...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...
Abstract Interpretation, one of the most applied techniques for semantics based static analysis of s...
AbstractA completion via Frink ideals is used to define a convex powerdomain of an arbitrary continu...
Abstract. Numeric abstract domains are widely used in program anal-yses. The simplest numeric domain...
In set theory [1], two sets are considered to have the same cardinality, if a one-to-one corresponde...
AbstractIn the context of static analysis via abstract interpretation, convex polyhedra constitute t...
In the context of static analysis via abstract interpretation, convex polyhedra constitute the most ...
We discuss the construction of proper widening operators on several weakly-relational numeric abstra...
Abstract. We discuss the construction of proper widening operators on several weakly-relational nume...
Online version Dec 2009, paper version 2010.International audienceWe consider the problem of formali...
A procedure is described for tightening domain constraints of finite domain logic programs by applyi...
In the context of the standard Cousot and Cousot framework, refinement operators that systematically...
Operators that systematically produce more precise abstract interpretations from simpler ones are in...
AbstractIn this paper we present how sweeping line techniques, which are very popular in computation...
Abstract. Automata over infinite words provide a powerful framework to solve various decision proble...
Non-trivial analysis problems require complete lattices with infinite ascending and descending chain...
Abstract Interpretation, one of the most applied techniques for semantics based static analysis of s...
AbstractA completion via Frink ideals is used to define a convex powerdomain of an arbitrary continu...
Abstract. Numeric abstract domains are widely used in program anal-yses. The simplest numeric domain...
In set theory [1], two sets are considered to have the same cardinality, if a one-to-one corresponde...