aslanix / SmallStepNI
Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq
☆18Updated 5 years ago
Alternatives and similar repositories for SmallStepNI:
Users that are interested in SmallStepNI are comparing it to the libraries listed below
- Bedrock Bit Vector Library☆27Updated last year
- ☆54Updated 3 weeks ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 7 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- a version of the 2048 game for Coq☆22Updated last year
- Relation algebra library for Coq☆48Updated 3 weeks ago
- Finite sets and maps for Coq with extensional equality☆29Updated 3 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 11 months ago
- Constructive Galois connections☆32Updated 7 years ago
- An enhanced unification algorithm for Coq☆54Updated 3 weeks ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- ☆13Updated 5 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 2 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆13Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Reflection library for Coq☆12Updated 5 years ago
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- Mechanizations of Type Theories☆28Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Deadlock freedom by type checking☆19Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- gallina frontend for CompCert☆17Updated 5 years ago
- Lenses in Coq☆17Updated 2 years ago
- ☆29Updated last year