Combined Satisfiability Modulo Parametric Theories

DOI10.1007/978-3-540-71209-1_47zbMath1186.68297OpenAlexW1871671368MaRDI QIDQ5758134

Sava Krstić, Cesare Tinelli, Amit Goel, Jim Grundy

Publication date: 3 September 2007

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_47

Mathematics Subject Classification ID

Related Items (12)

Satisfiability Modulo Theories ⋮ Metalevel algorithms for variant satisfiability ⋮ Combining stable infiniteness and (strong) politeness ⋮ Verifying Heap-Manipulating Programs in an SMT Framework ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Sets with Cardinality Constraints in Satisfiability Modulo Theories ⋮ Politeness and stable infiniteness: stronger together ⋮ Metalevel Algorithms for Variant Satisfiability ⋮ Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis ⋮ Combining Theories with Shared Set Operations ⋮ Polite combination of algebraic datatypes ⋮ Politeness for the theory of algebraic datatypes

This page was built for publication: Combined Satisfiability Modulo Parametric Theories