Alternatives and similar repositories for SMCHR

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

• nickmain / cchr
  Copy of the CCHR Constraint Handling Rules implementation in C
  ☆20Updated 3 years ago
• HarvardPL / formulog
  Datalog with support for SMT queries and first-order functional programming
  ☆162Updated 3 weeks ago
• oracle / souffle
  DEPRECATED. Soufflé is a translator of declarative Datalog programs into the C++ language.
  ☆49Updated 7 years ago
• TyGuS / suslik
  Synthesis of Heap-Manipulating Programs from Separation Logic
  ☆127Updated 2 years ago
• jfeser / L2
  λ² is a tool for synthesizing functional programs from input-output examples.
  ☆70Updated 2 years ago
• GillianPlatform / Gillian
  The Gillian Platform main repository
  ☆88Updated 3 weeks ago
• szabta89 / IncA
  Incremental Program Analysis Framework
  ☆93Updated 4 years ago
• wies / grasshopper
  An automated deductive program verifier.
  ☆42Updated 2 years ago
• marcelosousa / descartes
  descartes: the cartesian hoare logic prover
  ☆12Updated 8 years ago
• Kraks / sai
  Staged Abstract Interpreters
  ☆69Updated 2 years ago
• GaloisInc / llvm-pretty-bc-parser
  Parser for the llvm bitcode format
  ☆59Updated 3 weeks ago
• chifflier / ocaml-llvm-tutorial
  OCaml LLVM bindings tutorial
  ☆21Updated 8 years ago
• OCamlPro / alt-ergo
  OCamlPro public development repository for Alt-Ergo
  ☆139Updated 2 weeks ago
• unison-code / unison
  Unison's source code
  ☆108Updated last year
• marcelwa / CEGIS
  Counter-example guided inductive synthesis (CEGIS) implementation for the SMT solver Z3 by Microsoft Research
  ☆51Updated 8 years ago
• plast-lab / cclyzer
  A tool for analyzing LLVM bitcode using Datalog.
  ☆101Updated 4 years ago
• gangtan / CPUmodels
  GoNative project: formal machines models in Coq
  ☆36Updated 8 years ago
• ilyasergey / reachability
  Experimental implementation of k-CFA and Pushdown k-CFA with optional Abstract Garbage Collection for LambdaJS and a subset of Scheme pro…
  ☆30Updated 9 years ago
• cs-au-dk / MONA
  MONA - a decision procedure for monadic second-order logic on finite strings and trees
  ☆51Updated 5 years ago
• smowton / llpe
  ☆54Updated last year
• sneeuwballen / zipperposition
  An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…
  ☆149Updated 10 months ago
• SRI-CSL / sally
  SRI Sally: A model checker for infinite-state systems.
  ☆73Updated last month
• rupertlssmith / hak_wambook
  Implementation of "Warren's Abstract Machine: A Tutorial Reconstruction" by Hassan Aït-Kaci.
  ☆28Updated 8 years ago
• TiarkRompf / lancet
  surgical precision JIT compilers
  ☆122Updated 8 years ago
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆170Updated 3 weeks ago
• lorisdanto / symbolicautomata
  Library for symbolic automata and symbolic visibly pushdown automata
  ☆70Updated last month
• binsec / Rel
  Binsec/Rel is an extension of Binsec that implements relational symbolic execution for constant-time verification and secret-erasure at b…
  ☆33Updated 7 months ago
• yhyoon / simba
  Synthesis from Inductive specification eMpowered by Bidirectional Abstract Interpretation
  ☆21Updated last year
• stedolan / mlsub
  Prototype type inference engine
  ☆204Updated 7 months ago
• c-cube / mc2
  [research] A modular SMT solver in OCaml, based on mcSAT
  ☆39Updated last year