Proving concurrent noninterference

Popescu, Andrei, Hölzl, Johannes and Nipkow, Tobias (2012) Proving concurrent noninterference. Certified Programs and Proofs: second international conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings. In: 2nd International Conference on Certified Programs and Proofs (CPP 2012), 13-15 Dec 2012, Kyoto, Japan. ISBN 9783642353079. ISSN 0302-9743 [Conference or Workshop Item]

This is the latest version of this item.

PDF - Final accepted version (with author's formatting)
Download (245kB) | Preview


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 noninterference 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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published paper appears in: Certified Programs and Proofs, Volume 7679 of the series Lecture Notes in Computer Science pp 109-125, 2012
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15375
Notes on copyright: The final publication is available at Springer via
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 27 Apr 2015 12:58
Last Modified: 09 Jun 2021 20:00

Available Versions of this Item

  • Proving concurrent noninterference. (deposited 27 Apr 2015 12:58) [Currently Displayed]

Actions (login required)

View Item View Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year