@inproceedings{d533b3e86bc94e3d86038e13e5b1583d,
title = "Noninterfering schedulers 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.",
author = "Andrei Popescu and Johannes H{\"o}lzl and Tobias Nipkow",
year = "2013",
doi = "10.1007/978-3-642-40206-7_18",
language = "English",
isbn = "9783642402050",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "236--252",
booktitle = "Algebra and Coalgebra in Computer Science - 5th International Conference, CALCO 2013, Proceedings",
note = "5th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2013 ; Conference date: 03-09-2013 Through 06-09-2013",
}