Armael / cdclLinks
☆16Updated 5 years ago
Alternatives and similar repositories for cdcl
Users that are interested in cdcl are comparing it to the libraries listed below
Sorting:
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 8 months ago
- The main codex repository☆24Updated last year
- Katamaran is a semi-automated separation logic verifier for the Sail specification language. It works on an embedded version of Sail call…☆18Updated last week
- Tons of Inductive Problems: The Benchmarks☆26Updated 2 years ago
- QUICr parametric abstract domain for sets☆12Updated 10 years ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 4 years ago
- An ocaml implementation of conflict-driven reasoning☆14Updated 7 years ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆15Updated last month
- ☆24Updated last week
- Formalisation of a capability machine and principles for reasoning about security properties☆22Updated 3 months ago
- ☆39Updated 3 weeks ago
- Concurrency property fuzzing tool for Lwt-based OCaml programs☆29Updated 4 years ago
- Tiny verified SAT-solver☆30Updated 3 years ago
- A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superpos…☆27Updated 2 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- The MemCAD static analyzer☆26Updated 4 years ago
- Solver for Constrained Horn Clauses☆46Updated last week
- A Lustre compiler in Coq☆71Updated 4 months ago
- Topochecker, a topological model checker☆19Updated 5 years ago
- MoCHi: Model Checker for Higher-Order Programs☆43Updated 6 months ago
- A verified Implementation of a mini prolog☆17Updated 2 years ago
- A simple BDD library for OCaml☆13Updated 5 months ago
- An OCaml library providing a C parser and lexer☆42Updated 11 months ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated 2 months ago
- ☆37Updated 6 months ago
- ☆14Updated last week
- An overlay for the OCaml Z3 binding.☆35Updated 3 years ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year