Formalizing probabilistic noninterference

Popescu, Andrei, Hölzl, Johannes and Nipkow, Tobias (2013) Formalizing probabilistic noninterference. In: 3rd International Conference on Certified Programs and Proofs (CPP 2013), 11-13 Dec 2013, Melbourne, VIC, Australia.

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

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.

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 http://dx.doi.org/10.1007/978-3-319-03545-1_17
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 27 Apr 2015 12:33
Last Modified: 31 May 2019 03:14
URI: https://eprints.mdx.ac.uk/id/eprint/15369

Actions (login required)

Edit Item Edit 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