Alternatives and similar repositories for yacfe

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

• unison-code / uni-instr-sel
  Universal instruction selection
  ☆12Updated 7 years ago
• lindig / quest
  A tool for testing C compilers automatically
  ☆21Updated 9 years 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
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆21Updated 9 years ago
• Drup / llvmgraph
  Ocamlgraph overlay for llvm
  ☆20Updated 10 years ago
• mmottl / cfg
  OCaml library for manipulating context-free grammars
  ☆20Updated 3 months ago
• c-cube / mc2
  [research] A modular SMT solver in OCaml, based on mcSAT
  ☆39Updated last year
• Antique-team / memcad
  The MemCAD static analyzer
  ☆27Updated 4 years ago
• raph-amiard / CamllVM
  An OCaml bytecode to LLVM compiler
  ☆43Updated 7 years ago
• termite-analyser / llvm2smt
  OCaml library to transform an Llvm control flow graph in an SMT formula.
  ☆13Updated 7 years ago
• aprolog-lang / aprolog
  αProlog
  ☆18Updated 2 years ago
• BinaryAnalysisPlatform / FrontC
  An OCaml library providing a C parser and lexer
  ☆42Updated last year
• JUrban / MPTP2
  ☆19Updated 8 years ago
• jfeser / L2
  λ² is a tool for synthesizing functional programs from input-output examples.
  ☆87Updated 2 years ago
• charliermarsh / OCaml-SAT-Solvers
  An OCaml implementation of the DPLL algorithm for solving SAT instances. Uses nothing beyond the OCaml List library.
  ☆19Updated 11 years ago
• nyu-acsys / drift
  An abstract-interpretation-based static analysis for inferring refinement types
  ☆16Updated 3 months ago
• codinuum / cca
  Code Continuity Analysis Framework
  ☆22Updated 8 months ago
• aposwolsky / delphin
  The Delphin Project
  ☆10Updated 9 years ago
• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆34Updated 3 weeks ago
• AdaCore / sparkformal
  The project SPARK Formal aims at developing a complete semantics of the SPARK language in Coq.
  ☆12Updated 4 years ago
• evdenis / acsl-proved
  Fully proved small C functions (examples for verification course).
  ☆16Updated 8 years ago
• termite-analyser / z3overlay
  An overlay for the OCaml Z3 binding.
  ☆35Updated 3 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆49Updated 11 years ago
• FredMesnard / LPTP
  LPTP: A Logic Program Theorem Prover, written by Robert F. Staerk in the mid 1990's
  ☆14Updated 3 months ago
• cfbolz / minitrace
  experiments in building tiny tracing JITs in various languages (Prolog to start)
  ☆11Updated last year
• yallop / staged-generic-programming
  Code for "Staged Generic Programming" (ICFP 2017)
  ☆28Updated 2 years ago
• camllight / camllight
  The Caml Light implementation of the Caml language
  ☆67Updated 2 years ago
• cverified / cbench
  A benchmark for C program verification
  ☆17Updated last year
• mgree / kmt
  Kleene algebra modulo theories
  ☆27Updated 3 years ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆17Updated last year