Gbury / archsatLinks
A proof-producing SMT/McSat solver, handling polymorphic first-order logic, and using an SMT/McSat core extended using Tableaux, Superposition and Rewriting.
☆27Updated 2 years ago
Alternatives and similar repositories for archsat
Users that are interested in archsat are comparing it to the libraries listed below
Sorting:
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated 2 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 weeks ago
- An ocaml implementation of conflict-driven reasoning☆14Updated 7 years ago
- Prototype code for some Julia-OCaml bindings☆16Updated 5 years ago
- Kleene algebra modulo theories☆27Updated 3 years ago
- A simple BDD library for OCaml☆13Updated 7 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 11 months ago
- Experimental model finder/SMT solver for functional programming.☆23Updated 3 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 5 years ago
- Constraint solver based on abstract domains☆33Updated last year
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated 5 months ago
- ☆16Updated 6 years ago
- QUICr parametric abstract domain for sets☆12Updated 10 years ago
- An exact real arithmetic (aka constructive reals) for OCaml☆13Updated last year
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- ☆11Updated 3 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆38Updated 2 years ago
- A constraint solver built from scratch in OCaml