AbstractThe Nelson-Oppen combination method combines decision procedures for first-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 infinite. This restriction makes the method inapplicable to many interesting theories such as, for instance, theories having only finite models.In this paper we provide a new combination method that can combine any theory that is not stably infinite with another theory, provided that the latter is what we call a shiny theory. Examples of shiny theories include the theory of equality, the theory of partial orders, and the theory of total orders.An interesting consequence of our results is that a...
International audienceThe Nelson-Oppen combination method is ubiquitous in Satisfiability Modulo Th...
International audienceSatisfiability is the problem of deciding whether a formula has a model. Altho...
URL : http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-259/paper06.pdfInternational...
AbstractThe Nelson-Oppen combination method combines decision procedures for first-order theories ov...
The Nelson-Oppen combination method combines decision procedures for ¯rst-order theories over disjoi...
Abstract. The Nelson-Oppen combination method combines decision procedures for ¯rst-order theories o...
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...
http://www.springerlink.comIn program verification one has often to reason about lists over elements...
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 ...
AbstractWe exploit quantifier elimination in the global design of combined decision and semi-decisio...
Satisfiability is the problem of deciding whether a formula has a model. Although it is not even sem...
A satisfiability problem is often expressed in a combination of theories, and a natural approach con...
International audienceThe Nelson-Oppen combination method is ubiquitous in Satisfiability Modulo Th...
International audienceSatisfiability is the problem of deciding whether a formula has a model. Altho...
URL : http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-259/paper06.pdfInternational...
AbstractThe Nelson-Oppen combination method combines decision procedures for first-order theories ov...
The Nelson-Oppen combination method combines decision procedures for ¯rst-order theories over disjoi...
Abstract. The Nelson-Oppen combination method combines decision procedures for ¯rst-order theories o...
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...
http://www.springerlink.comIn program verification one has often to reason about lists over elements...
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 ...
AbstractWe exploit quantifier elimination in the global design of combined decision and semi-decisio...
Satisfiability is the problem of deciding whether a formula has a model. Although it is not even sem...
A satisfiability problem is often expressed in a combination of theories, and a natural approach con...
International audienceThe Nelson-Oppen combination method is ubiquitous in Satisfiability Modulo Th...
International audienceSatisfiability is the problem of deciding whether a formula has a model. Altho...
URL : http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-259/paper06.pdfInternational...