FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provide...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeter...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLC...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We present a translation from a logic of access control with a "says" operator to the classical modal logic S4. We prove that the translation is sound and complete. We al...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...