Author:
Barrett Clark W.,Dill David L.,Stump Aaron
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. C. Barrett, D. Dill, and J. Levitt. Validity Checking for Combinations of Theories with Equality. In Mandayam Srivas and Albert Camilleri, editors, Formal Methods In Computer-Aided Design, pages 187–201, 1996.
2. Clark W. Barrett. Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories. PhD thesis, Stanford University, 2002.
3. R. Bryant, S. German, and M. Velev. Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions. In 11th International Conference on Computer-Aided Verification, pages 470–482, 1999.
4. Leonardo de Moura, Harald Ruess, and Maria Sorea. Lazy Theorem Proving for Bounded Model Checking over Infinite Domains. In 18th International Conference on Automated Deduction, 2002.
5. L. e Silva, L. Silveira, and J. Marques-Silva. Algorithms for Solving Boolean Satisfiability in Combinational Circuits. In Proceedings of the IEEE/ACM Design, Automation and Test in Europe Conference (DATE), March 1999.
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Feature Selection-based Machine Learning Comparative Analysis for Predicting Breast Cancer;Applied Artificial Intelligence;2024-04-10
2. Scalable Bit-Blasting with Abstractions;Lecture Notes in Computer Science;2024
3. Bitwuzla;Computer Aided Verification;2023
4. Reverse engineering code dependencies;Proceedings of the 22nd International Systems and Software Product Line Conference - Volume 2;2018-09-10
5. Symbolic Reasoning Methods in Rewriting Logic and Maude;Logic, Language, Information, and Computation;2018