Satisfiability Modulo Free Data Structures Combined with Bridging Functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
combi-fds.pdf (316.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01389228 , version 1 (28-10-2016)

Identifiers

  • HAL Id : hal-01389228 , version 1

Cite

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⟩
113 View
68 Download

Share

Gmail Facebook X LinkedIn More