MarkusRabe / cadet
A fast and certifying solver for quantified Boolean formulas.
☆26Updated 10 months ago
Alternatives and similar repositories for cadet:
Users that are interested in cadet are comparing it to the libraries listed below
- MachSMT: An ML-Driven Algorithm Selection tool for SMT Solvers☆20Updated last year
- ☆34Updated 7 months ago
- configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…☆41Updated last year
- Cube-and-Conquer SAT solver☆32Updated last year
- Structured BVA☆33Updated 10 months ago
- CAQE is a solver for quantified Boolean formulas☆31Updated last year
- This repository contains the code of Intel(R) SAT Solver (IntelSAT)☆28Updated this week
- DepQBF, a solver for quantified boolean formulae (QBF).☆34Updated last year
- Source code for GpuShareSat, a library for SAT solvers to use the GPU for clause sharing between CPU threads.☆32Updated 3 years ago
- LinearArbitrary-SeaHorn is a CHC solver for LLVM-based languages.☆21Updated last year
- ☆11Updated 7 years ago
- Egraphs Modulo Theories☆13Updated this week
- ☆11Updated 8 months ago
- TriCera: a model checker for C programs☆24Updated last week
- A research platform and active library for generalised SAT solving☆33Updated 4 months ago
- ☆16Updated 9 months ago
- A Python API for the MiniSat and MiniCard constraint solvers.☆19Updated last year
- ☆15Updated 11 months ago
- Manthan for Boolean function synthesis☆32Updated last year
- ☆11Updated 3 years ago
- IC3PO: IC3 for Proving Protocol Properties☆25Updated 5 months ago
- SAT Heritage: a community-driven effort for archiving, building and running more than thousand SAT solvers☆38Updated 2 years ago
- Random Generator of Btor2 Files☆9Updated last year
- Solver for Constrained Horn Clauses☆35Updated this week
- A model-based API Fuzzer for SMT Solvers.☆13Updated 2 weeks ago
- Approximate Model Counter☆73Updated this week
- Pono: A flexible and extensible SMT-based model checker☆92Updated 2 weeks ago
- The Standard Interface for Incremental Satisfiability Solving☆49Updated 2 years ago
- A continuous local search SAT solver based on Fourier expansion for hybrid Boolean constraints.☆12Updated 5 months ago
- ☆17Updated last year