FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : The Nelson-Oppen combination method is ubiquitous in all Satisfiability Modulo Theories solvers. However, one of its major drawbacks is to be restricted to disjoint unions of theories. We investigate the problem of extending this combination method to particular non-disjoint unions of theories connected via bridging functions. This problem is of greatest interest for solving verification problems expressed in a combination of data structures and arithmetic. Our work can be viewed as a synthesis of previous contributions by different authors. We investigate here an approach by reduction from non-disjoint to disjoint combination which is particularly well-suited to combine the theory of absolutely free data structures with bridging functions over a target theory. We consider the problem of adapting the combination procedure to get a satisfiability procedure for the standard interpretations of the data structure. We present an enumeration procedure that allows us to revisit the case of lists with length.
Workshop on Automated Deduction: Decidability, Complexity, Tractability, ADDCT 2014. Held as Part of the Vienna Summer of Logic, affiliated with IJCAR 2014 and RTA 2014, Jul 2014, Vienna, Austria
https://hal.inria.fr/hal-01087218
Contributeur : Christophe Ringeissen
<>
Soumis le : mardi 25 novembre 2014 - 15:45:35
Dernière modification le : jeudi 15 février 2018 - 08:48:14
Paula Chocron, Pascal Fontaine, Christophe Ringeissen. Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging Functions. Workshop on Automated Deduction: Decidability, Complexity, Tractability, ADDCT 2014. Held as Part of the Vienna Summer of Logic, affiliated with IJCAR 2014 and RTA 2014, Jul 2014, Vienna, Austria. 〈hal-01087218〉
