Noninterfering schedulers. When possibilistic noninterference implies probabilistic noninterference

DOI10.1007/978-3-642-40206-7_18MaRDI QIDQ2848952zbMATH OpenOpenAlexFDO

Authors Andrei Popescu, Johannes Hölzl, Tobias Nipkow

Publication date 13 September 2013

Published in Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40206-7_18

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Formalizing probabilistic noninterference
• Noninterference for concurrent programs and thread systems
• scientific article; zbMATH DE number 1754606
• Proving concurrent noninterference
• scientific article; zbMATH DE number 1330436

Cited in

(5)

• Specification and static enforcement of scheduler-independent noninterference in a middleweight Java
• scientific article; zbMATH DE number 1754606 (Why is no real title available?)
• Noninterference for concurrent programs and thread systems
• Formalizing probabilistic noninterference
• Making Random Choices Invisible to the Scheduler

This page was built for publication: Noninterfering schedulers. When possibilistic noninterference implies probabilistic noninterference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848952)