Alternatives and similar repositories for NOVA

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

• bedrocksystems / coq-lens
  Lenses in Coq
  ☆19Updated 2 years ago
• rems-project / linksem
  Semantic model for aspects of ELF static linking and DWARF debug information
  ☆44Updated 5 months ago
• mit-plv / coqutil
  Coq library for tactics, basic definitions, sets, maps
  ☆48Updated this week
• mit-plv / bbv
  Bedrock Bit Vector Library
  ☆27Updated last year
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• cverified / cbench
  A benchmark for C program verification
  ☆16Updated last year
• vellvm / ctrees
  An itree-like data-structure to additionally support internal non-determinism
  ☆17Updated 2 months ago
• gangtan / CPUmodels
  GoNative project: formal machines models in Coq
  ☆36Updated 7 years ago
• joscoh / why3-semantics
  Formal Semantics for Why3
  ☆18Updated 3 weeks ago
• mit-pdos / mcqc
  A Gallina compiler with C++17 as an intermediate representation
  ☆43Updated 4 years ago
• CertiGraph / CertiGraph
  A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.
  ☆18Updated 3 weeks ago
• katamaran-project / katamaran
  Katamaran is a semi-automated separation logic verifier for the Sail specification language. It works on an embedded version of Sail call…
  ☆18Updated last week
• nandor / llir-opt
  LLIR cross-language post-link optimiser for OCaml and C
  ☆17Updated 3 years ago
• evdenis / acsl-proved
  Fully proved small C functions (examples for verification course).
  ☆16Updated 7 years ago
• acorrenson / SATurne
  Tiny verified SAT-solver
  ☆27Updated 3 years ago
• arthuraa / memory-safe-language
  A formalization of properties of a simple imperative, memory-safe language.
  ☆19Updated 3 years ago
• taktoa / eqsat
  A language-generic implementation of equality saturation in Haskell
  ☆21Updated 6 years ago
• bluerock-io / BRiCk
  Formalization of C++ for verification purposes.
  ☆80Updated last week
• lucypa / sDDF
  seL4 Device Driver Framework
  ☆23Updated last year
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• uwplse / potpie
  Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct
  ☆16Updated 9 months ago
• mit-plv / rewriter
  Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting
  ☆24Updated 2 months ago
• PrincetonUniversity / DeepSpecDB
  ☆27Updated last month
• vzaliva / helix
  Formally verified operator language and rewriting engine for high-performance computing
  ☆26Updated 11 months ago
• rocq-community / bignums
  Coq library of arbitrarily large numbers, providing BigN, BigZ, BigQ that used to be part of the standard library [maintainers=@proux01,@…
  ☆24Updated 4 months ago
• ankitku / TAL0
  Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.
  ☆22Updated 8 years ago
• true-grue / graph-irs
  Slides from a talk "Graph-Based Intermediate Representations: An Overview and Perspectives"
  ☆21Updated last year