Noninterfering Schedulers [chapter]

Andrei Popescu, Johannes Hölzl, Tobias Nipkow
2013 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-642-40206-7_18 fatcat:eemioxa35jgjfbdkrcbwkaqnrq