Possibilistic Noninterference

Andrei Popescu 🌐 and Johannes Hölzl 📧

September 10, 2012

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


We formalize a wide variety of Volpano/Smith-style noninterference notions for a while language with parallel composition. We systematize and classify these notions according to compositionality w.r.t. the language constructs. Compositionality yields sound syntactic criteria (a.k.a. type systems) in a uniform way.

An article about these proofs is published in the proceedings of the conference Certified Programs and Proofs 2012.


BSD License


Session Possibilistic_Noninterference