1633 search results - page 189 / 327 » On the Verification of Temporal Properties |
AI
2008
Springer
13 years 10 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
ENTCS
2006
13 years 10 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
SP
2008
IEEE
13 years 10 months ago
2008
IEEE
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
CCS
2010
ACM
13 years 8 months ago
2010
ACM
We propose a development method for security protocols based on stepwise refinement. Our refinement strategy guides sformation of abstract security goals into protocols that are s...