Rocket-Fast Proof Checking for SMT Solvers
From MaRDI portal
Recommendations
Cites work
- \textsf{CC(X)}: semantic combination of congruence closure with solvable theories
- Computer Aided Verification
- Cooperating theorem provers: a case study combining HOL-Light and CVC Lite
- Efficient E-Matching for SMT Solvers
- scientific article; zbMATH DE number 2090315 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Towards Maude 2. 0
- Translation of resolution proofs into short first-order proofs without choice axioms
Cited in
(12)- Don't care words with an application to the automata-based approach for real addition
- Efficient, verified checking of propositional proofs
- 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
- Modular SMT proofs for fast reflexive checking inside Coq
- Satisfiability modulo theories
- Fine grained SMT proofs for the theory of fixed-width bit-vectors
- Automating theorem proving with SMT
- Scalable fine-grained proofs for formula processing
- \textsc{Carcara}: an efficient proof checker and elaborator for SMT proofs in the Alethe format
This page was built for publication: Rocket-Fast Proof Checking for SMT Solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458346)
