MathiasVP / ni-formal-gc
Coq formalization of timing-sensitive noninterference for a garbage collected language with heap and runtime pc level.
☆9Updated 5 years ago
Alternatives and similar repositories for ni-formal-gc
Users that are interested in ni-formal-gc are comparing it to the libraries listed below
Sorting:
- Formal verification of the Algorand consensus protocol☆27Updated 2 years ago
- A formalization of a Proof-of-Stake Nakamoto-style blockchain in Coq☆25Updated 4 years ago
- second-order abstract syntax☆31Updated 3 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Byzantine model checker☆21Updated 2 years ago
- KORE to llvm translation☆38Updated last week
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated last year
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆18Updated 5 years ago
- Easily create authenticated data structures☆43Updated 2 years ago
- A Coq-based framework to verify the correctness of Byzantine fault-tolerant distributed systems☆31Updated 5 years ago
- Documented version of a simple type-theoretic language: Mini-TT☆18Updated 6 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- A minimalistic blockchain consensus implemented and verified in Coq☆111Updated 5 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- An implementation of a simple asynchronous message-passing lock server, verified in Coq using the Verdi framework☆14Updated 7 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated last month
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- An itree-like data-structure to additionally support internal non-determinism☆17Updated last month
- Coq library for tactics, basic definitions, sets, maps☆47Updated last week
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 6 months ago
- ☆14Updated 10 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆31Updated 3 weeks ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- APIs for more recursive definitions☆19Updated 6 months ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- A linter for Soufflé Datalog☆14Updated last year
- A tool for translating imperative programs to CSP.☆12Updated 8 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago