Author:
Conchon Sylvain,Krstić Sava
Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. L. Bachmair, N. Dershowitz, Commutation, transformation, and termination, in: J. Siekmann (Ed.), Proc. Eighth Internat. Conf. Automated Deduction (CADE), Lecture Notes in Computer Science, vol. 230, Springer, Berlin, 1986, pp. 5–20.
2. Abstract congruence closure;Bachmair;J. Automated Reasoning,2003
3. T. Ball, B. Cook, S.K. Lahiri, S.K. Rajamani, Zapato: automatic theorem proving for predicate abstraction refinement, in: Proc. 16th Internat. Conf. Computer Aided Verification (CAV), Lecture Notes in Computer Science, Springer, Berlin, 2004.
4. C. Barrett, Checking validity of quantifier-free formulas in combinations of first-order theories, Ph.D. Thesis, Stanford University, 2002.
5. C. Barrett, S. Berezin, CVC Lite. 〈http://verify.stanford.edu/CVCL/〉
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献