Proving Concurrent Noninterference

  • Andrei Popescu
  • Johannes Hölzl
  • Tobias Nipkow
Conference paper

DOI: 10.1007/978-3-642-35308-6_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7679)
Cite this paper as:
Popescu A., Hölzl J., Nipkow T. (2012) Proving Concurrent Noninterference. In: Hawblitzel C., Miller D. (eds) Certified Programs and Proofs. CPP 2012. Lecture Notes in Computer Science, vol 7679. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Andrei Popescu
    • 1
    • 2
  • Johannes Hölzl
    • 1
  • Tobias Nipkow
    • 1
  1. 1.Technische Universität MünchenGermany
  2. 2.Institute of Mathematics Simion StoilowRomania

Personalised recommendations