Author:
Barrett Clark,Shikanian Igor,Tinelli Cesare
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Abstract congruence closure;Bachmair;JAR,2003
2. C. Barrett and S. Berezin. CVC Lite: A new implementation of the cooperating validity checker. In Proceedings of CAV, pages 515–518, July 2004
3. C. Barrett, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Splitting on demand in satisfiability modulo theories. Technical report, University of Iowa, 2006. Available at ftp://ftp.cs.uiowa.edu/pub/tinelli/papers/BarNOT-RR-06.pdf
4. C. Barrett, I. Shikanian, and C. Tinelli. An abstract decision procedure for satisfiability in the theory of recursive data types. Technical Report TR2005-878, Department of Computer Science, New York University, Nov. 2005
5. M.P. Bonacina and M. Echenim. Generic theorem proving for decision procedures. Technical report, Università degli studi di Verona, 2006. Available at http://profs.sci.univr.it/~echenim/
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Syntax-Guided Quantifier Instantiation;Tools and Algorithms for the Construction and Analysis of Systems;2021
2. cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis;Computer Aided Verification;2019
3. A Framework for Computer-Aided Design of Educational Domain Models;Lecture Notes in Computer Science;2017-12-29
4. SyGuS Techniques in the Core of an SMT Solver;Electronic Proceedings in Theoretical Computer Science;2017-11-28
5. Satisfiability Modulo Bounded Checking;Automated Deduction – CADE 26;2017