weakmemory / immLinks
Intermediate Memory Model (IMM) and compilation correctness proofs for it
☆29Updated 7 months ago
Alternatives and similar repositories for imm
Users that are interested in imm are comparing it to the libraries listed below
Sorting:
- ☆55Updated 5 months ago
- Hahn: A Coq library☆30Updated last year
- Ltac2 tutorial☆45Updated 2 years ago
- A Coq library for parametric coinduction☆50Updated 7 months ago
- Formalization of C++ for verification purposes.☆84Updated this week
- Relation algebra library for Coq☆49Updated 5 months ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- Bedrock Bit Vector Library☆28Updated 3 months ago
- Library to create Coq record update functions☆48Updated 2 weeks ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆23Updated last year
- Deadlock freedom by type checking☆20Updated 2 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 weeks ago
- Some basic libraries for Coq.☆14Updated last week
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Updated 3 years ago
- ☆27Updated last year
- Finite sets and maps for Coq with extensional equality☆30Updated 3 months ago
- ☆37Updated 5 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆55Updated 2 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- Collection of Distributed Protocol Verification Problems☆14Updated last year
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 4 years ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆20Updated 5 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆35Updated last week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated last year
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- Coq formalizations and proofs of (data) structures and algorithms.☆45Updated 7 years ago
- Coq library on rewriting theory and termination☆36Updated last month