Formalizing probabilistic noninterference

Popescu, Andrei, Hölzl, Johannes and Nipkow, Tobias (2013) Formalizing probabilistic noninterference. Certified Programs and Proofs: Third International Conference, CPP 2013, Melbourne, VIC, Australia, December 11-13, 2013, Proceedings. In: 3rd International Conference on Certified Programs and Proofs (CPP 2013), 11-13 Dec 2013, Melbourne, VIC, Australia. ISBN 9783319035444. ISSN 0302-9743 [Conference or Workshop Item]

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


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.

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

Actions (login required)

View Item View Item


Activity Overview
6 month trend
6 month trend

Additional statistics are available via IRStats2.