Abstract. The Nelson-Oppen combination method combines decision procedures for ¯rst-order theories over disjoint signatures into a single decision procedure for the union theory. To be correct, the method requires that the component theories be stably in¯nite. This restriction makes the method inapplicable to many interesting theories such as, for instance, theories having only ¯nite models. In this paper, we describe two extensions of the Nelson-Oppen method that address the problem of combining theories that are not stably in¯nite. In our ex-tensions, the component decision procedures exchange not only equalities between shared variables, but also certain cardinality constraints. Applications of our results include the combination of theo...
Solving the satisfiability problem modulo a theory given as a union of decid-able sub-theories natur...
Abstract. In this paper we present our work in progress towards obtain-ing a Nelson-Oppen style comb...
International audienceSatisfiability is the problem of deciding whether a formula has a model. Altho...
The Nelson-Oppen combination method combines decision procedures for ¯rst-order theories over disjoi...
AbstractThe Nelson-Oppen combination method combines decision procedures for first-order theories ov...
AbstractA crucial step in the assertional verification of concurrent programs is deciding whether so...
A crucial step in the assertional verification of concurrent programs is deciding whether some sets ...
The Nelson-Oppen combination method can be used to combine decision procedures for the validity of q...
Abstract. Combination of theories underlies the design of satisfiability modulo theories (SMT) solve...
International audienceA satisfiability problem is often expressed in a combination of theories, and ...
Abstract. The Nelson-Oppen combination method combines decision procedures for theories satisfying c...
Satisfiability is the problem of deciding whether a formula has a model. Although it is not even sem...
Abstract. We present a combination method for generating inter-polants for a class of first-order th...
We extend Nelson-Oppen combination procedure to the case of theories which are compatible with respe...
version courte de inria-00331735 (INRIA RR-6697)International audienceWe present a novel technique t...
Solving the satisfiability problem modulo a theory given as a union of decid-able sub-theories natur...
Abstract. In this paper we present our work in progress towards obtain-ing a Nelson-Oppen style comb...
International audienceSatisfiability is the problem of deciding whether a formula has a model. Altho...
The Nelson-Oppen combination method combines decision procedures for ¯rst-order theories over disjoi...
AbstractThe Nelson-Oppen combination method combines decision procedures for first-order theories ov...
AbstractA crucial step in the assertional verification of concurrent programs is deciding whether so...
A crucial step in the assertional verification of concurrent programs is deciding whether some sets ...
The Nelson-Oppen combination method can be used to combine decision procedures for the validity of q...
Abstract. Combination of theories underlies the design of satisfiability modulo theories (SMT) solve...
International audienceA satisfiability problem is often expressed in a combination of theories, and ...
Abstract. The Nelson-Oppen combination method combines decision procedures for theories satisfying c...
Satisfiability is the problem of deciding whether a formula has a model. Although it is not even sem...
Abstract. We present a combination method for generating inter-polants for a class of first-order th...
We extend Nelson-Oppen combination procedure to the case of theories which are compatible with respe...
version courte de inria-00331735 (INRIA RR-6697)International audienceWe present a novel technique t...
Solving the satisfiability problem modulo a theory given as a union of decid-able sub-theories natur...
Abstract. In this paper we present our work in progress towards obtain-ing a Nelson-Oppen style comb...
International audienceSatisfiability is the problem of deciding whether a formula has a model. Altho...