c-cube / mc2Links
[research] A modular SMT solver in OCaml, based on mcSAT
☆39Updated last year
Alternatives and similar repositories for mc2
Users that are interested in mc2 are comparing it to the libraries listed below
Sorting:
- 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
- Kleene algebra modulo theories☆27Updated 2 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 8 months ago
- Experimental model finder/SMT solver for functional programming.☆23Updated 3 years ago
- A simple BDD library for OCaml☆13Updated 5 months ago
- A constraint solver built from scratch in OCaml☆12Updated 3 years ago
- An ocaml implementation of conflict-driven reasoning☆14Updated 7 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10Updated 3 years ago
- First-order automated theorem prover based on the tableau method☆17Updated 2 months ago
- A Deductive Verification Tool for OCaml Programs☆75Updated 2 weeks ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆68Updated 5 months ago
- multi-shot continuations in OCaml☆49Updated last week
- Effects-based OCaml Nameserver☆36Updated 4 months ago
- Code for "Staged Generic Programming" (ICFP 2017)☆27Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 6 years ago
- Choice operator in OCaml, providing a backtracking monad☆26Updated 3 years ago
- Faithful reimplementation of Minisat 2.2 in OCaml.☆38Updated 2 years ago
- OCaml syntax extension for synchronous programming...☆32Updated 2 years ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year
- Essentials of Programming Languages, with OCaml implementations & Coq proofs☆32Updated 8 years ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 4 years ago
- Efficient binder representation in OCaml☆43Updated last year
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆45Updated 5 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Prototype code for some Julia-OCaml bindings☆16Updated 4 years ago
- ☆16Updated 6 years ago
- QUICr parametric abstract domain for sets☆12Updated 10 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago