charliermarsh / OCaml-SAT-SolversLinks
An OCaml implementation of the DPLL algorithm for solving SAT instances. Uses nothing beyond the OCaml List library.
☆19Updated 11 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:
- OCaml code to construct an NFA from a regular expression☆52Updated 5 years ago
- A modular sat/smt solver with proof output.☆101Updated last year
- Racket bindings for Z3☆24Updated 6 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Optimizing Abstract Abstract Machines☆31Updated 8 years ago
- An overlay for the OCaml Z3 binding.☆35Updated 3 years ago
- ☆56Updated this week
- Dolmen provides a library and a binary to parse, typecheck, and evaluate languages used in automated deduction☆88Updated 3 months ago
- Lecture material for DeepSpec Summer School 2018☆68Updated 6 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
- Abstracting Definitional Interpreters☆74Updated 8 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- An HTML documentation generator for Coq source files☆31Updated last year
- A generic goal preprocessing tool for proof automation tactics in Coq☆15Updated 3 months ago
- Kleene algebra modulo theories☆27Updated 3 years ago
- An automatic theorem prover for first order logic with equality☆31Updated 5 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆69Updated 7 months ago
- A graduate seminar on SMT solving and solver-aided systems☆28Updated 3 years ago
- Algebraic Combinatorics in Coq☆39Updated 2 months ago
- Offline partial evaluation system for Prolog written using the cogen approach☆21Updated 9 years ago
- Parallel ML compiler☆74Updated 5 years ago
- Notes for CIS 700 (Fall '19) at Syracuse U.☆13Updated 6 years ago
- DOrder -- Automatically Learning Shape Specifications☆20Updated 8 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 10 months ago
- SPARK 2014 repository for the Why3 verification platform.☆34Updated last week
- Emacs support for F*☆70Updated 5 months ago
- Repository and Wiki for enriching the Standard ML Basis Library☆64Updated 4 years ago
- Examples from the class CMSC 330 during Summer 2015☆49Updated 10 years ago