aslanix / SmallStepNILinks
Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq
☆19Updated 5 years ago
Alternatives and similar repositories for SmallStepNI
Users that are interested in SmallStepNI are comparing it to the libraries listed below
Sorting:
- Bedrock Bit Vector Library☆28Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- Finite sets and maps for Coq with extensional equality☆30Updated 2 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- ☆55Updated 4 months ago
- gallina frontend for CompCert☆18Updated 6 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Relation algebra library for Coq☆49Updated 4 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated this week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆61Updated 11 months ago
- A framework for extensible, reflective decision procedures.☆19Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 6 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- ☆13Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Agda programming with holes☆27Updated 4 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆29Updated 2 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago