Skip to Main content Skip to Navigation
New interface
Conference papers

Satisfiability Modulo Free Data Structures Combined with Bridging Functions

Abstract : Free Data Structures are finite semantic trees modulo equational axioms that are useful to represent classical data structures such as lists, multisets and sets. We study the satisfiability problem when free data structures are combined with bridging functions. We discuss the possibility to get a combination methodàmethod`methodà la Nelson-Oppen for these particular non-disjoint unions of theories. In order to handle satisfiability problems with disequalities, we investigate a form of sufficient surjectivity for the bridging functions.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Christophe Ringeissen Connect in order to contact the contributor
Submitted on : Friday, October 28, 2016 - 10:51:23 AM
Last modification on : Friday, February 4, 2022 - 3:31:50 AM


Files produced by the author(s)


  • HAL Id : hal-01389228, version 1



Raphaël Berthon, Christophe Ringeissen. Satisfiability Modulo Free Data Structures Combined with Bridging Functions. 14th International Workshop on Satisfiability Modulo Theories, affiliated with IJCAR 2016, Jul 2016, Coimbra, Portugal. pp.71--80. ⟨hal-01389228⟩



Record views


Files downloads