Noninterfering Schedulers

When Possibilistic Noninterference Implies Probabilistic Noninterference
  • Andrei Popescu
  • Johannes Hölzl
  • Tobias Nipkow
Conference paper

DOI: 10.1007/978-3-642-40206-7_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8089)
Cite this paper as:
Popescu A., Hölzl J., Nipkow T. (2013) Noninterfering Schedulers. In: Heckel R., Milius S. (eds) Algebra and Coalgebra in Computer Science. CALCO 2013. Lecture Notes in Computer Science, vol 8089. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Andrei Popescu
    • 1
  • Johannes Hölzl
    • 1
  • Tobias Nipkow
    • 1
  1. 1.Technische Universität MünchenGermany

Personalised recommendations