Rocket-Fast Proof Checking for SMT Solvers
From MaRDI portal
Publication:5458346
DOI10.1007/978-3-540-78800-3_38zbMATH Open1134.68492OpenAlexW155339612MaRDI QIDQ5458346FDOQ5458346
Authors: Michał Moskal 
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
Recommendations
Cites Work
- Towards Maude 2. 0
- Efficient E-Matching for SMT Solvers
- Title not available (Why is that?)
- \textsf{CC(X)}: semantic combination of congruence closure with solvable theories
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- Cooperating theorem provers: a case study combining HOL-Light and CVC Lite
- Translation of resolution proofs into short first-order proofs without choice axioms
- Title not available (Why is that?)
Cited In (12)
- Scalable fine-grained proofs for formula processing
- A framework for certified Boolean branch-and-bound optimization
- Automating theorem proving with SMT
- Fine grained SMT proofs for the theory of fixed-width bit-vectors
- Don't care words with an application to the automata-based approach for real addition
- A unified framework for DPLL(T) + certificates
- Modular SMT proofs for fast reflexive checking inside Coq
- Satisfiability modulo theories
- Efficient, verified checking of propositional proofs
- SMT proof checking using a logical framework
- \textsc{Carcara}: an efficient proof checker and elaborator for SMT proofs in the Alethe format
- versat: A Verified Modern SAT Solver
Uses Software
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)
