Frontiers of Combining Systems
From MaRDI portal
Publication:5491892
DOI10.1007/11559306zbMath1171.68439OpenAlexW4205914269MaRDI QIDQ5491892
Christophe Ringeissen, Calogero G. Zarba, Silvio Ranise
Publication date: 10 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11559306
Related Items (18)
Sharing Is Caring: Combination of Theories ⋮ Satisfiability Modulo Theories ⋮ A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited ⋮ Reasoning about vectors: satisfiability modulo a theory of sequences ⋮ Combining stable infiniteness and (strong) politeness ⋮ Weakly Equivalent Arrays ⋮ A Rewriting Approach to the Combination of Data Structures with Bridging Theories ⋮ Being careful about theory combination ⋮ Many-sorted equivalence of shiny and strongly polite theories ⋮ Automatic decidability and combinability ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Sort It Out with Monotonicity ⋮ Politeness and combination methods for theories with bridging functions ⋮ Politeness and stable infiniteness: stronger together ⋮ Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis ⋮ Polite combination of algebraic datatypes ⋮ Politeness for the theory of algebraic datatypes ⋮ Reasoning about vectors using an SMT theory of sequences
This page was built for publication: Frontiers of Combining Systems
