Sciweavers

9 search results - page 1 / 2
» Bisimulation for Demonic Schedulers
Sort
View
FOSSACS
2009
Springer
13 years 11 months ago
Bisimulation for Demonic Schedulers
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
Konstantinos Chatzikokolakis, Gethin Norman, David...
CSFW
2003
IEEE
13 years 10 months ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
IANDC
2010
116views more  IANDC 2010»
13 years 3 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
IFIPTCS
2010
13 years 2 months ago
Safe Equivalences for Security Properties
Abstract. In the field of Security, process equivalences have been used to characterize various information-hiding properties (for instance secrecy, anonymity and non-interference)...
Mário S. Alvim, Miguel E. Andrés, Ca...
JLP
2007
86views more  JLP 2007»
13 years 4 months ago
Typing noninterference for reactive programs
We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvin...
Ana Almeida Matos, Gérard Boudol, Ilaria Ca...