1472 search results - page 87 / 295 » On Model Checking Infinite-State Systems |
130
click to vote
CAV
2010
Springer
15 years 7 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
135
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
148
click to vote
IS
2011
14 years 10 months ago
2011
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
181
click to vote
ESORICS
2009
Springer
16 years 4 months ago
2009
Springer
Current techniques for the formal modeling analysis of DoS attacks do not adequately deal with amplification attacks that may target a complex distributed system as a whole rather ...
141
Voted
KBSE
2010
IEEE
15 years 2 months ago
2010
IEEE
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...