charliermarsh / OCaml-SAT-SolversLinks
An OCaml implementation of the DPLL algorithm for solving SAT instances. Uses nothing beyond the OCaml List library.
☆19Updated 10 years ago
Alternatives and similar repositories for OCaml-SAT-Solvers
Users that are interested in OCaml-SAT-Solvers are comparing it to the libraries listed below
Sorting:
- A modular sat/smt solver with proof output.☆101Updated last year
- DOrder -- Automatically Learning Shape Specifications☆20Updated 8 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- ☆55Updated 4 months ago
- Optimizing Abstract Abstract Machines☆31Updated 8 years ago
- The LLVM tutorial using OCaml☆60Updated 5 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
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- Racket bindings for Z3☆24Updated 6 years ago
- OCaml library for partially ordered maps☆15Updated this week
- Experimental model finder/SMT solver for functional programming.☆23Updated 3 years ago
- Notes for CIS 700 (Fall '19) at Syracuse U.☆13Updated 5 years ago
- Abstracting Definitional Interpreters☆69Updated 7 years ago
- Fully proved small C functions (examples for verification course).☆16Updated 8 years ago
- A graduate seminar on SMT solving and solver-aided systems☆27Updated 3 years ago
- An overlay for the OCaml Z3 binding.☆34Updated 2 years ago
- Lecture material for DeepSpec Summer School 2018☆68Updated 6 years ago
- The MemCAD static analyzer☆26Updated 3 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 7 months ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated 2 weeks ago
- Examples from the class CMSC 330 during Summer 2015☆48Updated 10 years ago
- A splay tree implementation.☆13Updated 4 months ago
- Dolmen provides a library and a binary to parse, typecheck, and evaluate languages used in automated deduction☆88Updated 2 weeks ago
- OCaml hash-consing library☆51Updated last year
- The (very) small kernel of the LaTTe proof assistant☆12Updated 5 months ago
- OCaml code to construct an NFA from a regular expression☆52Updated 5 years ago
- An ocaml implementation of conflict-driven reasoning☆14Updated 7 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated last week
- Constraint solver based on abstract domains☆32Updated 10 months ago