User: Guest  Login
Author(s):
Andrei Popescu <popescua@in.tum.de>, Johannes Hölzl <hoelzl@in.tum.de>, Tobias Nipkow <nipkow@in.tum.de>
Title:
Noninterfering Schedulers
Subtitle:
When Possibilistic Noninterference Implies Probabilistic Noninterference
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.
Keywords:
noninterference, probabilistic noninterference, schedulers
Year:
2013
Language:
en
 BibTeX