1463 search results - page 86 / 293 » Model Checking Implicit-Invocation Systems |
114
Voted
TACAS
2005
Springer
15 years 7 months ago
2005
Springer
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of ve...
112
Voted
CAV
2010
Springer
15 years 5 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...
119
Voted
FOSSACS
2009
Springer
15 years 8 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...
167
Voted
ESORICS
2009
Springer
16 years 2 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 ...
115
click to vote
KBSE
2010
IEEE
15 years 4 days 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...