TY - JOUR AU - Popescu, Andrei AU - Hölzl, Johannes AU - Nipkow, Tobias PY - 2013/01/01 Y2 - 2024/03/29 TI - Formal Verification of Language-Based Concurrent Noninterference JF - Journal of Formalized Reasoning JA - JFR VL - 6 IS - 1 SE - Articles DO - 10.6092/issn.1972-5787/3690 UR - https://jfr.unibo.it/article/view/3690 SP - 1-30 AB - 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. ER -