volodeyka / trust-coqLinks
Formalization of the Truly Stateless Concurrency Model Checker in Coq
☆13Updated 4 years ago
Alternatives and similar repositories for trust-coq
Users that are interested in trust-coq are comparing it to the libraries listed below
Sorting:
- ☆38Updated 8 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- Coq library on rewriting theory and termination☆37Updated 2 weeks ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year
- ☆13Updated 6 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 10 months ago
- Lenses in Coq☆17Updated 3 years ago
- Relation algebra library for Coq☆49Updated 2 weeks ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated 2 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆38Updated 2 years ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 4 years ago
- Hahn: A Coq library☆29Updated last year
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- Kleene algebra modulo theories☆27Updated 3 years ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 5 years ago
- haha I'm graduating☆14Updated 4 years ago
- A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web☆46Updated 3 years ago
- Formal Semantics for Why3☆19Updated 2 months ago
- ☆56Updated last week
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆36Updated last month
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Updated last week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆38Updated 3 months ago
- Partial Commutative Monoids☆32Updated 6 months ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated last week