AbstractZonotopes are a convenient abstract domain for the precise analysis of programs with numerical variables. Compared to the domain of convex polyhedra, it is less expensive and may easily handle non-linear assignments. However, the classical join operator of this abstract domain does not always preserve linear invariants, unlike the convex hull. We present a global join operator that preserves some affine relations. We end up by showing some experiments conducted on the constrained Taylor1+ domain of Apron
To perform rigorous numerical computations, one can use a gen-eralization of interval arithmetic, na...
We present a constant-round algorithm in the massively parallel computation(MPC) model for evaluatin...
AbstractWe investigate whether a sound and complete formal system for join dependencies can be found...
AbstractZonotopes are a convenient abstract domain for the precise analysis of programs with numeric...
International audienceWe propose to extend an existing framework combining abstract interpretation a...
AbstractLinear invariants are essential in many optimization and verification tasks. The domain of c...
We consider an abstraction of programs which preserves affine assignments exactly while conservative...
Linear invariants are essential in many optimization and verication tasks. The domain of convex poly...
We propose joinwidth, a new complexity parameter for the Constraint Satisfaction Problem (CSP). The ...
International audienceLinear relation analysis (polyhedral analysis), devoted to discovering linear ...
This talk will survey some results on join processing that use inequalities from convex geometry. Re...
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem ...
Abstract. The octagon abstract domain, devoted to discovering octagonal con-straints (also called Un...
A connected component labeling algorithm is developed for implicitly defined domains specified by mu...
A geometric join is the union of all colorful simplices spanned by a colored point set in the d-dime...
To perform rigorous numerical computations, one can use a gen-eralization of interval arithmetic, na...
We present a constant-round algorithm in the massively parallel computation(MPC) model for evaluatin...
AbstractWe investigate whether a sound and complete formal system for join dependencies can be found...
AbstractZonotopes are a convenient abstract domain for the precise analysis of programs with numeric...
International audienceWe propose to extend an existing framework combining abstract interpretation a...
AbstractLinear invariants are essential in many optimization and verification tasks. The domain of c...
We consider an abstraction of programs which preserves affine assignments exactly while conservative...
Linear invariants are essential in many optimization and verication tasks. The domain of convex poly...
We propose joinwidth, a new complexity parameter for the Constraint Satisfaction Problem (CSP). The ...
International audienceLinear relation analysis (polyhedral analysis), devoted to discovering linear ...
This talk will survey some results on join processing that use inequalities from convex geometry. Re...
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem ...
Abstract. The octagon abstract domain, devoted to discovering octagonal con-straints (also called Un...
A connected component labeling algorithm is developed for implicitly defined domains specified by mu...
A geometric join is the union of all colorful simplices spanned by a colored point set in the d-dime...
To perform rigorous numerical computations, one can use a gen-eralization of interval arithmetic, na...
We present a constant-round algorithm in the massively parallel computation(MPC) model for evaluatin...
AbstractWe investigate whether a sound and complete formal system for join dependencies can be found...