TACAS
2007
Springer
13 years 11 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We describe a method for enumerating all essentially different executions possible for a cryptographic protocol. We call them the shapes of the protocol. Naturally occur...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
We describe a new algorithm for analysing security protocols that use XOR, such as key-management APIs. As a case study, we consider the IBM 4758 CCA API, which is widely used in t...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Recent studies have demonstrated the possibility to build genetic regulatory networks that confer a desired behavior to a living organism. However, the design of these ne...