This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
This article introduces the turtle++ library which combines constraint-based and imperative paradigms and enables in this way constraint imperative programming (CIP) with c++. Inte...
Abstract. In this paper we propose a certification technique for noninterference of Java programs based on rewriting logic, a very general logical and semantic framework efficientl...
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
Abstract. There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to...
Nicholas Nethercote, Peter J. Stuckey, Ralph Becke...