Formal Verification of Language-Based Concurrent Noninterference
We perform a formal analysis of compositionality techniques for
proving possibilistic noninterference for a while language with
parallel composition. We develop a uniform framework where we express
a wide range of non-interference variants from the literature and
compare them w.r.t. their contracts: the strength of the security
properties they ensure weighed against the harshness of the syntactic
conditions they enforce. This results in a simple implementable
algorithm for proving that a program has a specific noninterference
property, using only compositionality, which captures uniformly
several security type-system results from the literature and suggests
a further improved type system. All formalism and theorems have been
mechanically verified in Isabelle/HOL.
pdf
BibTeX:
@article{PopescuHN-JFR13,
author={Andrei Popescu and Johannes H{\"o}lzl and Tobias Nipkow},
title={Formal Verification of Language-Based Concurrent Noninterference},
journal={J. Formalized Reasoning},volume={6},number={1},year=2013,pages={1-30}}