5216 search results - page 99 / 1044 » Planning as Model Checking |
108
Voted
ICFEM
2009
Springer
15 years 7 months ago
2009
Springer
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
101
click to vote
ESORICS
2002
Springer
16 years 8 days ago
2002
Springer
Abstract. In this paper, we consider how one can analyse a stream authentication protocol using model checking techniques. In particular, we will be focusing on the Timed Efficient...
96
Voted
PAPM
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...
108
click to vote
ATVA
2007
Springer
15 years 4 months ago
2007
Springer
A fair non-repudiation protocol should guarantee, (1) when a sender sends a message to a receiver, neither the sender nor the receiver can deny having participated in this communic...
130
Voted
CAV
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...