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
Related projects ⓘ
Alternatives and complementary repositories for ni-formal-gc
- A formalization of a Proof-of-Stake Nakamoto-style blockchain in Coq☆25Updated 3 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- Byzantine model checker☆21Updated last year
- second-order abstract syntax☆31Updated 3 years ago
- A formally verified bug finder☆14Updated last year
- Formal verification of the Algorand consensus protocol☆26Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆71Updated last week
- Coq Enhancement Proposals☆49Updated 2 weeks ago
- Genetic program repair using GHC☆30Updated 6 months ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- A type theory for tiny objects☆10Updated 11 months ago
- An itree-like data-structure to additionally support internal non-determinism☆14Updated this week
- A Coq-based framework to verify the correctness of Byzantine fault-tolerant distributed systems☆28Updated 5 years ago
- Verified implementation of Brzozowski derivatives in Idris☆9Updated 5 years ago
- Collects examples used to produce the paper 'Session Types with Linearity in Haskell' by Orchard and Yoshida (2017).☆12Updated 11 months ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- The Steel separation logic library for F*☆31Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- https://unsafeperform.io/blog/2022-07-02-a_small_benchmark_for_functional_languages_targeting_web_browsers/☆27Updated last year
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆18Updated 4 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated 2 months ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆19Updated last year
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆14Updated last year
- ☆20Updated 6 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated 8 months ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year