6608 search results - page 123 / 1322 » On the Completeness of Model Checking |
147
click to vote
ICFEM
2009
Springer
15 years 11 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...
139
click to vote
ESORICS
2002
Springer
16 years 4 months 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...
125
click to vote
PAPM
2001
Springer
15 years 9 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...
158
click to vote
CAV
2004
Springer
15 years 8 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. ...
121
click to vote
DALT
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bd...