Satisfiability Modulo Free Data Structures Combined with Bridging Functions

Raphaël Berthon (1) , Christophe Ringeissen (2)

1 ENS Rennes - École normale supérieure - Rennes
2 PESTO - Proof techniques for security protocols

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.

Domaines: Logique en informatique [cs.LO]

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⟩