A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited

(1) , (2) , (3)
1
2
3

Abstract

The Nelson-Oppen combination method is ubiquitous in 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. The motivation is, e.g., to solve verification problems expressed in a combination of data structures connected to arithmetic with bridging functions such as the length of lists and the size of trees. We present a sound and complete combination procedure à la Nelson-Oppen for the theory of absolutely free data structures, including lists and trees. This combination procedure is then refined for standard interpretations. The resulting theory has a nice politeness property, enabling combinations with arbitrary decidable theories of elements.
Fichier principal
Vignette du fichier
bridging-nd-compact.pdf (499.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01157898 , version 1 (28-05-2015)

Identifiers

Cite

Paula Chocron, Pascal Fontaine, Christophe Ringeissen. A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited. 25th International Conference on Automated Deduction, CADE-25, Christoph Benzmueller, Aug 2015, Berlin, Germany. pp.419-433, ⟨10.1007/978-3-319-21401-6_29⟩. ⟨hal-01157898⟩
432 View
191 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More