Sciweavers

1302 search results - page 119 / 261
» Fair Equivalence Relations
Sort
View
FOSSACS
2009
Springer
16 years 19 days 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...
ICALP
2009
Springer
16 years 19 days ago
Qualitative Concurrent Stochastic Games with Imperfect Information
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
Vincent Gripon, Olivier Serre
IDEAS
2009
IEEE
104views Database» more  IDEAS 2009»
16 years 15 days ago
An organizational file permission management system using the cellular data system
In designing dynamic situations such as cyberworlds, we the Incrementally Modular Abstraction Hierarchy (IMAH) to be an appropriate mathematical background to model dynamically ch...
Toshio Kodama, Tosiyasu L. Kunii, Yoichi Seki
LICS
2008
IEEE
16 years 7 days ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen
SSC
2007
Springer
192views Cryptology» more  SSC 2007»
15 years 12 months ago
On Boolean Functions Which Are Bent and Negabent
Bent functions f : Fm 2 → F2 achieve largest distance to all linear functions. Equivalently, their spectrum with respect to the Hadamard-Walsh transform is flat (i.e. all spectr...
Matthew G. Parker, Alexander Pott