Alternatives and similar repositories for smbc

Users that are interested in smbc are comparing it to the libraries listed below

• c-cube / mc2
  [research] A modular SMT solver in OCaml, based on mcSAT
  ☆39Updated last year
• mgree / kmt
  Kleene algebra modulo theories
  ☆27Updated 2 years ago
• arlencox / QUICr
  QUICr parametric abstract domain for sets
  ☆12Updated 10 years ago
• c-cube / sidekick
  A modular library for CDCL(T) SMT solvers, with [wip] proof generation.
  ☆25Updated 7 months ago
• Gbury / archsat
  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
• monadius / ocaml_simple_interval
  A simple and portable floating-point interval arithmetic library in OCaml
  ☆10Updated 3 years ago
• arjunguha / ocaml-z3
  ☆16Updated 6 years ago
• bobatkey / playtime
  An OCaml EDSL for describing and solving strategic games
  ☆17Updated 2 years ago
• yallop / staged-generic-programming
  Code for "Staged Generic Programming" (ICFP 2017)
  ☆27Updated 2 years ago
• uwplse / cheerios
  Formally verified Coq serialization library with support for extraction to OCaml
  ☆24Updated last year
• witan-org / witan
  An ocaml implementation of conflict-driven reasoning
  ☆14Updated 7 years ago
• ocamllabs / ocaml-memory-model
  ☆29Updated 6 years ago
• RyanGibb / eon
  Effects-based OCaml Nameserver
  ☆20Updated 3 months ago
• backtracking / program-proofs-with-why3
  Some programs from Rustan Leino's "Program Proofs", in Why3.
  ☆16Updated 2 years ago
• voodoos / mlts
  ☆11Updated 2 years ago
• nyu-acsys / drift
  An abstract-interpretation-based static analysis for inferring refinement types
  ☆16Updated last month
• mmcco / verified-parser-example
  A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.
  ☆20Updated 10 years ago
• zenon-prover / zenon
  The Zenon theorem prover
  ☆15Updated 2 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• rlepigre / ocaml-earley
  Parsing library based on Earley Algorithm
  ☆18Updated 3 months ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 6 years ago
• OlivierNicole / macros-examples
  Examples to illustrate the use of experimental OCaml macros
  ☆12Updated 7 years ago
• backtracking / ocaml-bdd
  A simple BDD library for OCaml
  ☆13Updated 3 months ago
• Deducteam / zenon_modulo
  First-order automated theorem prover based on the tableau method
  ☆17Updated 3 weeks ago
• dannywillems / RML
  ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.
  ☆38Updated 3 years ago
• backtracking / ptmap
  Implementation of maps of integers with Patricia trees
  ☆22Updated 5 years ago
• formal-land / coq-bonsai
  🌳 Generate a fresh bonsai in your terminal
  ☆28Updated 3 years ago
• yallop / metaocaml-syb
  Scrap Your Boilerplate for MetaOCaml with modular implicits
  ☆18Updated 9 years ago
• LaurentMazare / ocaml.jl
  Prototype code for some Julia-OCaml bindings
  ☆16Updated 4 years ago
• UCSD-PL / veridrone
  Foundational Verification of Hybrid Systems
  ☆15Updated 8 years ago