Very small examples of TLA+ features.
☆42Apr 14, 2019Updated 6 years ago
Alternatives and similar repositories for tiny-tlaplus-examples
Users that are interested in tiny-tlaplus-examples are comparing it to the libraries listed below
Sorting:
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- static analysis of free monads☆24Jul 10, 2018Updated 7 years ago
- ☆22Jun 28, 2019Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- Convert TLA+ output (and values) into JSON☆27Mar 3, 2021Updated 4 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- proof script associated to tutorial material☆17Oct 29, 2023Updated 2 years ago
- A collection of useful TLA+ operators☆21Feb 15, 2018Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Fully proved small C functions (examples for verification course).☆17Jun 26, 2017Updated 8 years ago
- A TLA+ guide☆278Jul 1, 2022Updated 3 years ago
- Coq Lecture Notes (WIP)☆56Oct 17, 2020Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Jul 19, 2025Updated 7 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Racket bindings for Z3☆20Aug 7, 2012Updated 13 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- Source Code for 'Practical TLA+' by Hillel Wayne☆297Apr 13, 2022Updated 3 years ago
- Talks on category-parametric programming.☆23Dec 15, 2023Updated 2 years ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Jul 11, 2016Updated 9 years ago
- Translation from FOL to LTL+Past and LTL, via separation of LTL+Past☆10May 22, 2024Updated last year
- Utilities for the TLA+ ecoystem and model-based testing using TLA+.☆27Nov 18, 2022Updated 3 years ago
- Idris tactics for (commutative) monoids☆20May 24, 2020Updated 5 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Jupyter kernel for TLA⁺☆120Sep 12, 2022Updated 3 years ago
- A curated list of TLA+ resources.☆66Jul 18, 2019Updated 6 years ago
- Proving a blocking queue deadlock free in a dozen different ways☆44Oct 28, 2024Updated last year
- Tests with PlusCal / TLA+☆25Jan 12, 2017Updated 9 years ago
- Specs and models for solving the DeadlockEmpire problems using TLA+ and TLC☆22Apr 11, 2019Updated 6 years ago
- TLA+ snippets, operators, and modules contributed and curated by the TLA+ community☆304Updated this week
- Experiments with modal types☆17Oct 20, 2020Updated 5 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Git Archive Daemon (mirror of https://gitorious.org/gitorious/git-archive-daemon)☆13Nov 18, 2014Updated 11 years ago
- ☆14Nov 23, 2016Updated 9 years ago