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.
@article{3690,
title = {Formal Verification of Language-Based Concurrent Noninterference},
journal = {Journal of Formalized Reasoning},
volume = {6},
year = {2013},
doi = {10.6092/issn.1972-5787/3690},
language = {EN},
url = {http://dml.mathdoc.fr/item/3690}
}
Popescu, Andrei; Hölzl, Johannes; Nipkow, Tobias. Formal Verification of Language-Based Concurrent Noninterference. Journal of Formalized Reasoning, Tome 6 (2013) . doi : 10.6092/issn.1972-5787/3690. http://gdmltest.u-ga.fr/item/3690/