volodeyka / trust-coq
Formalization of the Truly Stateless Concurrency Model Checker in Coq
☆13Updated 3 years ago
Alternatives and similar repositories for trust-coq:
Users that are interested in trust-coq are comparing it to the libraries listed below
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 7 months ago
- Finite sets and maps for Coq with extensional equality☆29Updated 2 months ago
- Hahn: A Coq library☆30Updated 8 months ago
- Coq library on rewriting theory and termination☆36Updated 2 weeks ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆15Updated last year
- Deadlock freedom by type checking☆19Updated last year
- ☆13Updated 5 years ago
- Lenses in Coq☆16Updated 2 years ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆20Updated 10 months ago
- ☆35Updated 4 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated last month
- Some basic libraries for Coq.☆14Updated 3 years ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆28Updated 4 years ago
- Intermediate Memory Model (IMM) and compilation correctness proofs for it☆24Updated 3 weeks ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆54Updated this week
- Kleene algebra modulo theories☆27Updated 2 years ago
- ☆12Updated 5 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- ☆13Updated last month
- Formalising session types in Coq☆17Updated 5 years ago
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆35Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 7 months ago
- Class instances for Coq inductive types with little boilerplate☆24Updated last week