Program logic for developing and verifying distributed systems
☆36Updated this week
Alternatives and similar repositories for aneris
Users that are interested in aneris are comparing it to the libraries listed below
Sorting:
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆21May 22, 2019Updated 6 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- Formalisation of a capability machine and principles for reasoning about security properties☆26Jul 4, 2025Updated 7 months ago
- A constraint solver built from scratch in OCaml☆12Dec 10, 2021Updated 4 years ago
- guarded interaction trees☆11Jul 4, 2025Updated 7 months ago
- (Extremely) simple standalone symbolic algebra library in OCaml. (Mirrored from original site.)☆12Oct 6, 2011Updated 14 years ago
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆35Feb 20, 2026Updated last week
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- ☆16Jun 25, 2019Updated 6 years ago
- A self-hosting subset of git functionality in 500 lines☆13Aug 27, 2018Updated 7 years ago
- First-order automated theorem prover based on the tableau method☆18Jan 3, 2026Updated last month
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆59Jul 4, 2025Updated 7 months ago
- A mechanisation of Wasm in Isabelle.☆32Feb 13, 2026Updated 2 weeks ago
- L-system interpreter in OCaml☆21Dec 10, 2015Updated 10 years ago
- Higher-order FRP compiler☆16Oct 20, 2021Updated 4 years ago
- Katamaran is a semi-automated separation logic verifier for the Sail specification language. It works on an embedded version of Sail call…☆19Feb 18, 2026Updated last week
- ☆72Sep 4, 2025Updated 5 months ago
- A Coq to Cedille compiler written in Coq☆34Sep 22, 2020Updated 5 years ago
- A program logic for concurrent randomized programs☆14Nov 9, 2018Updated 7 years ago
- Here we give programs that check if Turing machines halt or not.☆15Sep 1, 2025Updated 5 months ago
- TLA+ specs and models for the TezEdge node's p2p overlay network, shell, and consensus☆21Dec 14, 2021Updated 4 years ago
- Standard library for the Formality language☆18Mar 22, 2020Updated 5 years ago
- ☆21Jan 24, 2022Updated 4 years ago
- A first-order concurrent automated theorem prover☆23Aug 29, 2025Updated 6 months ago
- A symbolic analyser for shell scripts.☆22Sep 17, 2021Updated 4 years ago
- Library for Classical Coq☆41Jan 20, 2026Updated last month
- Deadlock freedom by type checking☆20Jun 2, 2023Updated 2 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Adding extensions to DOT calculus☆24Jan 19, 2020Updated 6 years ago
- ☆21Mar 15, 2016Updated 9 years ago
- Interactive Theorem Proving for students☆21Aug 26, 2023Updated 2 years ago
- The Rocq Prover bot☆26Jan 30, 2026Updated 3 weeks ago
- A Tutorial on Reflecting in Coq the generation of Hoare proof obligations [maintainer=@k4rtik]☆22Nov 25, 2021Updated 4 years ago
- Hanoi tower in Coq☆26Jan 29, 2026Updated last month
- Relative Monad Library for Agda☆24May 29, 2019Updated 6 years ago
- Library to create Coq record update functions☆48Nov 25, 2025Updated 3 months ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- OCaml bytecode library tools☆33Apr 19, 2022Updated 3 years ago