Formal Verification of Language-Based Concurrent Noninterference

Journal of Formalized Reasoning

Andrei Popescu²  Johannes Hölzl²  Tobias Nipkow¹ 

[1] Technische Universität München

关键词: floating-point arithmetic;    double rounding;    Coq;   

DOI  :  

学科分类：计算机科学（综合）

来源: Universita degli Studi di Bologna

【 摘 要 】

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.

【 授权许可】

Unknown