### Abstract

We formalize a probabilistic noninterference for a multi-threaded language with uniform scheduling, where probabilistic behaviour comes from both the scheduler and the individual threads. We define notions probabilistic noninterference in two variants: resumption-based and trace-based. For the resumption-based notions, we prove compositionality w.r.t. the language constructs and establish sound type-system-like syntactic criteria. This is a formalization of the mathematical development presented at CPP 2013 and CALCO 2013. It is the probabilistic variant of the Possibilistic Noninterference AFP entry.

### License

BSD License

### Topics

- Computer science/Security

### Session Probabilistic_Noninterference

- Interface
- Language_Semantics
- Resumption_Based
- Trace_Based
- Compositionality
- Syntactic_Criteria
- Concrete

### Depends on

- Coinductive
- Markov Models

## Cite

×

Probabilistic_Noninterference-AFP

    @article{Probabilistic_Noninterference-AFP,
      author  = {Andrei Popescu and Johannes Hölzl},
      title   = {Probabilistic Noninterference},
      journal = {Archive of Formal Proofs},
      month   = {March},
      year    = {2014},
      note    = {\url{https://isa-afp.org/entries/Probabilistic_Noninterference.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 20, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Aug 28, 2014 : Isabelle2014
- Mar 16, 2014 : Isabelle2013-2