Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq
-
Updated
Feb 22, 2020 - Coq
Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq
The Agda mechanization of a gradual security-typed programming language with general mutable references.
Strong non-interference for fine-grained concurrent programs
Formalisation of "Noninterference, Transitivity, and Channel-Control Security Policies" by J. Rushby
Add a description, image, and links to the noninterference topic page so that developers can more easily learn about it.
To associate your repository with the noninterference topic, visit your repo's landing page and select "manage topics."