Add to ORKGSet constraints are relations between sets of terms. They have been used extensively in various applications in program analysis and type inference. We present several results on the computational complexity of solving systems of set constraints. The systems we study form a natural complexity hierarchy depending on the form of the language
In set-based program analysis, one first infers a set constraint $\phi$ from a program and then, in ...
We investigate the relationship between set constraints and the monadic class of first-order formula...
We investigate the relationship between set constraints and the monadic class of first-order formula...
Abstract. Set constraints are relations between sets of terms. They have been used extensively in va...
. General agreement exists about the usefulness of sets as very highlevel representations of complex...
General agreement exists about the usefulness of sets as very highlevel representations of complex d...
Systems of set constraints are a natural formal-ism for many problems in program analysis. Set con-s...
We investigate the relationship between set constraints and the monadic class of first-order formula...
Typestate systems ensure many desirable properties of imperativeprograms, including initialization o...
AbstractSet constraints are relations between sets of ground terms over a given alphabet. They give ...
Abstract. Set constraints are a natural formalism for many problems that arise in program analysis. ...
Set constraints are inclusion relations between sets of ground terms over a ranked alphabet. They h...
An extended abstract of this paper appears in Proceedings of IJCAI-11. The third author left the aut...
International audienceWe study the computational complexity of reasoning with global constraints. We...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
In set-based program analysis, one first infers a set constraint $\phi$ from a program and then, in ...
We investigate the relationship between set constraints and the monadic class of first-order formula...
We investigate the relationship between set constraints and the monadic class of first-order formula...
Abstract. Set constraints are relations between sets of terms. They have been used extensively in va...
. General agreement exists about the usefulness of sets as very highlevel representations of complex...
General agreement exists about the usefulness of sets as very highlevel representations of complex d...
Systems of set constraints are a natural formal-ism for many problems in program analysis. Set con-s...
We investigate the relationship between set constraints and the monadic class of first-order formula...
Typestate systems ensure many desirable properties of imperativeprograms, including initialization o...
AbstractSet constraints are relations between sets of ground terms over a given alphabet. They give ...
Abstract. Set constraints are a natural formalism for many problems that arise in program analysis. ...
Set constraints are inclusion relations between sets of ground terms over a ranked alphabet. They h...
An extended abstract of this paper appears in Proceedings of IJCAI-11. The third author left the aut...
International audienceWe study the computational complexity of reasoning with global constraints. We...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
In set-based program analysis, one first infers a set constraint $\phi$ from a program and then, in ...
We investigate the relationship between set constraints and the monadic class of first-order formula...
We investigate the relationship between set constraints and the monadic class of first-order formula...