Noninterfering schedulers: when possibilistic noninterference implies probabilistic noninterference

Popescu, Andrei, Hölzl, Johannes and Nipkow, Tobias (2013) Noninterfering schedulers: when possibilistic noninterference implies probabilistic noninterference. Algebra and Coalgebra in Computer Science: 5th International Conference, CALCO 2013, Warsaw, Poland, September 3-6, 2013. Proceedings. In: 5th Conference on Algebra and Coalgebra in Computer Science (CALCO), 3-6 Sep 2013, Warsaw, Poland. ISBN 9783642402050. ISSN 0302-9743 [Conference or Workshop Item]

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

Abstract

We develop a framework for expressing and analyzing the behavior of probabilistic schedulers. There, we define noninterfering schedulers by a probabilistic interpretation of Goguen and Meseguer’s seminal notion of noninterference.
Noninterfering schedulers are proved to be safe in the following sense: if a multi-threaded program is possibilistically noninterfering, then it is also probabilistically noninterfering when run under this scheduler.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published paper appears in: Algebra and Coalgebra in Computer Science, Volume 8089 of the series Lecture Notes in Computer Science pp 236-252, 2013
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15371
Notes on copyright: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40206-7_18
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 27 Apr 2015 12:38
Last Modified: 15 Jun 2021 11:08
URI: https://eprints.mdx.ac.uk/id/eprint/15371

Actions (login required)

View Item View Item

Statistics

Downloads
Activity Overview
79Downloads
299Hits

Additional statistics are available via IRStats2.