TY - GEN
T1 - Proving concurrent noninterference
AU - Popescu, Andrei
AU - Hölzl, Johannes
AU - Nipkow, Tobias
N1 - Funding Information:
Supported by the DFG project Ni 491/13–1 (part of the DFG priority program RS3) and the DFG RTG 1480.
PY - 2012
Y1 - 2012
N2 - 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.
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 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.
UR - http://www.scopus.com/inward/record.url?scp=84869801451&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-35308-6_11
DO - 10.1007/978-3-642-35308-6_11
M3 - Conference contribution
AN - SCOPUS:84869801451
SN - 9783642353079
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 109
EP - 125
BT - Certified Programs and Proofs - Second International Conference, CPP 2012, Proceedings
T2 - 2nd International Conference on Certified Programs and Proofs, CPP 2012
Y2 - 13 December 2012 through 15 December 2012
ER -