Deciding Combinations of Theories
Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
Fast congruence closure and extensions
Information and Computation
SMT(CLU): a step toward scalability in system verification
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
CAV'07 Proceedings of the 19th international conference on Computer aided verification
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Using Dynamic Symbolic Execution to Improve Deductive Verification
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Combining Decision Procedures by (Model-)Equality Propagation
Electronic Notes in Theoretical Computer Science (ENTCS)
On Deciding Satisfiability by DPLL($\Gamma+{\mathcal T}$) and Unsound Theorem Proving
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
veriT: An Open, Trustable and Efficient SMT-Solver
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Ground Interpolation for Combined Theories
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Theory decision by decomposition
Journal of Symbolic Computation
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Sets with cardinality constraints in satisfiability modulo theories
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
On interpolation in decision procedures
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
Sharing is caring: combination of theories
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Combining decision procedures by (model-)equality propagation
Science of Computer Programming
Decision procedures for region logic
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
FDCC: a combined approach for solving constraints over finite domains and arrays
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
SMTInterpol: an interpolating SMT solver
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Being careful about theory combination
Formal Methods in System Design
| Hi-index | 0.00 |
Traditional methods for combining theory solvers rely on capabilities of the solvers to produce all implied equalities or a pre-processing step that introduces additional literals into the search space. This paper introduces a combination method that incrementally reconciles models maintained by each theory. We evaluate the practicality and efficiency of this approach.