Model-based Theory Combination
Authors:
Open Access
- 1 May 2008
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 198 (2) , 37-49
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fast congruence closure and extensionsInformation and Computation, 2007
- Solving SAT and SAT Modulo TheoriesJournal of the ACM, 2006
- Efficient theory combination via boolean searchInformation and Computation, 2006
- SMT(CLU)2006 IEEE/ACM International Conference on Computer Aided Design, 2006
- To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$Lecture Notes in Computer Science, 2006
- Simplify: a theorem prover for program checkingJournal of the ACM, 2005
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- Complexity, convexity and combinations of theoriesTheoretical Computer Science, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979