3147 search results - page 357 / 630 » Open-Source Model Checking |
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
138
click to vote
IPL
2007
15 years 4 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
AI
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we investigate the extent to which knowledge compilation can be used to improve model checking and inference from propositional weighted bases. We first focus on th...
148
click to vote
MOC
2002
15 years 4 months ago
2002
The mortar technique turns out to be well adapted to handle mesh adaptivity in finite elements, since it allows for working with nonnecessarily compatible discretizations on the el...
150
click to vote
ACSD
2010
IEEE
15 years 2 months ago
2010
IEEE
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...