Alternatives and similar repositories for archsat

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

• c-cube / mc2
  [research] A modular SMT solver in OCaml, based on mcSAT
  ☆39Updated last year
• backtracking / ocaml-bdd
  A simple BDD library for OCaml
  ☆13Updated 4 months ago
• monadius / ocaml_simple_interval
  A simple and portable floating-point interval arithmetic library in OCaml
  ☆10Updated 3 years ago
• Deducteam / zenon_modulo
  First-order automated theorem prover based on the tableau method
  ☆17Updated last month
• mgree / kmt
  Kleene algebra modulo theories
  ☆27Updated 2 years ago
• c-cube / sidekick
  A modular library for CDCL(T) SMT solvers, with [wip] proof generation.
  ☆25Updated 8 months ago
• c-cube / smbc
  Experimental model finder/SMT solver for functional programming.
  ☆23Updated 3 years ago
• rocq-community / atbr
  Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]
  ☆24Updated 11 months ago
• acorrenson / modulus
  A constraint solver built from scratch in OCaml
  ☆11Updated 3 years ago
• math-comp / multinomials
  Multinomials for the Mathematical Components library.
  ☆15Updated this week
• witan-org / witan
  An ocaml implementation of conflict-driven reasoning
  ☆14Updated 7 years ago
• LaurentMazare / ocaml.jl
  Prototype code for some Julia-OCaml bindings
  ☆16Updated 4 years ago
• strub / elliptic-curves-ssr
  A Formal Library about Elliptic Curves for the Mathematical Components Library.
  ☆15Updated 3 years ago
• mmcco / verified-parser-example
  A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.
  ☆20Updated 10 years ago
• xavierleroy / canonical-binary-tries
  Coq development accompanying the paper "Efficient Extensional Binary Tries"
  ☆21Updated last year
• pi8027 / efficient-finfun
  ☆13Updated 5 years ago
• mpelleau / AbSolute
  Constraint solver based on abstract domains
  ☆32Updated 11 months ago
• backtracking / program-proofs-with-why3
  Some programs from Rustan Leino's "Program Proofs", in Why3.
  ☆16Updated 2 years ago
• nyu-acsys / drift
  An abstract-interpretation-based static analysis for inferring refinement types
  ☆16Updated last month
• yallop / staged-generic-programming
  Code for "Staged Generic Programming" (ICFP 2017)
  ☆27Updated 2 years ago
• rocq-community / aac-tactics
  Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…
  ☆34Updated this week
• arlencox / QUICr
  QUICr parametric abstract domain for sets
  ☆12Updated 10 years ago
• mit-plv / rewriter
  Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting
  ☆25Updated last week
• arjunguha / ocaml-z3
  ☆16Updated 6 years ago
• rocq-community / coqffi
  Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]
  ☆38Updated 2 years ago
• ocaml-gospel / cameleer
  A Deductive Verification Tool for OCaml Programs
  ☆75Updated 2 months ago
• rocq-community / reglang
  Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]
  ☆45Updated 5 months ago
• ecranceMERCE / trakt
  A generic goal preprocessing tool for proof automation tactics in Coq
  ☆14Updated 3 weeks ago
• CoqHott / exceptional-tt
  A Coq plugin that implements exceptions in Coq
  ☆13Updated 4 years ago
• voodoos / mlts
  ☆11Updated 2 years ago