Formalizing Probabilistic Noninterference

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

DOI: 10.1007/978-3-319-03545-1_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8307)
Cite this paper as:
Popescu A., Hölzl J., Nipkow T. (2013) Formalizing Probabilistic Noninterference. In: Gonthier G., Norrish M. (eds) Certified Programs and Proofs. CPP 2013. Lecture Notes in Computer Science, vol 8307. Springer, Cham

Abstract

We present an Isabelle formalization of probabilistic noninterference for a multi-threaded language with uniform scheduling. Unlike in previous settings from the literature, here probabilistic behavior comes from both the scheduler and the individual threads, making the language more realistic and the mathematics more challenging. We study resumption-based and trace-based notions of probabilistic noninterference and their relationship, and also discuss compositionality w.r.t. the language constructs and type-system-like syntactic criteria. The formalization uses recent development in the Isabelle probability theory library.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

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 Stoilow of the Romanian AcademyRomania

Personalised recommendations