Abstract. We propose a syntax-driven test generation technique to auly derive abstract test cases from a set of requirements expressed in a linear temporal logic. Assuming that an ...
Abstract. We define an out-degree for F-coalgebras and show that the coalgebras of outdegree at most form a covariety. As a subcategory of all Fcoalgebras, this class has a termin...
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...