Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
Geometric constraints solving often relies on graphbased methods to decompose systems of geometric constraints. These methods have intrinsic and unavoidable limitations which are ...
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
Kim Marriott, Peter Moulder, Peter J. Stuckey, Ala...
We show how to combine program slicing and constraint solving in order to obtain better slice accuracy. The method is used in the VALSOFT slicing system. One particular applicatio...