CoqQFBV: a scalable certified SMT quantifier-free bit-vector solver
From MaRDI portal
Publication:832260
Recommendations
Cites work
- scientific article; zbMATH DE number 7378548 (Why is no real title available?)
- DRAT-based bit-vector proofs in CVC4
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Efficient verified (UN)SAT certificate checking
- Fast machine words in Isabelle/HOL
- Fine grained SMT proofs for the theory of fixed-width bit-vectors
- Isabelle/HOL. A proof assistant for higher-order logic
- LCF-style bit-blasting in HOL4
- Reconstruction of Z3's bit-vector proofs in HOL4 and Isabelle/HOL
- SMT proof checking using a logical framework
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(5)- Formal Verification of Bit-Vector Invertibility Conditions in Coq
- Towards bit-width-independent proofs in SMT solvers
- \textsc{CoqCryptoLine}: a verified model checker with certified results
- Certified verification for algebraic abstraction
- Fine grained SMT proofs for the theory of fixed-width bit-vectors
Describes a project that uses
Uses Software
This page was built for publication: CoqQFBV: a scalable certified SMT quantifier-free bit-vector solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832260)