Rocket-Fast Proof Checking for SMT Solvers
From MaRDI portal
Publication:5458346
DOI10.1007/978-3-540-78800-3_38zbMath1134.68492MaRDI QIDQ5458346
Publication date: 11 April 2008
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_38
Related Items
Scalable fine-grained proofs for formula processing, Don't care words with an application to the automata-based approach for real addition, A unified framework for DPLL(T) + certificates, A framework for certified Boolean branch-and-bound optimization, SMT proof checking using a logical framework, versat: A Verified Modern SAT Solver, Satisfiability Modulo Theories
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Translation of resolution proofs into short first-order proofs without choice axioms
- CC(X): Semantic Combination of Congruence Closure with Solvable Theories
- Efficient E-Matching for SMT Solvers
- Computer Aided Verification
- Tools and Algorithms for the Construction and Analysis of Systems