acorrenson / SATurneLinks
Tiny verified SAT-solver
☆30Updated 3 years ago
Alternatives and similar repositories for SATurne
Users that are interested in SATurne are comparing it to the libraries listed below
Sorting:
- Formal Semantics for Why3☆19Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A verified Implementation of a mini prolog☆17Updated 2 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated this week
- IO for Gallina☆32Updated 4 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- ☆24Updated 3 weeks ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated 3 months ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆38Updated 2 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- Deadlock freedom by type checking☆20Updated 2 years ago
- ☆13Updated 5 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Library for Classical Coq☆39Updated 5 months ago
- Monadic effects and equational reasoning in Rocq☆73Updated 3 weeks ago
- ☆15Updated 3 months ago
- ☆56Updated 3 weeks ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆46Updated 6 months ago
- ☆14Updated 5 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- Relation algebra library for Coq☆48Updated last month
- Coq library on rewriting theory and termination☆37Updated 3 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 9 months ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 3 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated 4 months ago
- haha I'm graduating☆14Updated 4 years ago