6608 search results - page 159 / 1322 » On the Completeness of Model Checking |
138
click to vote
TACAS
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
159
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. ...
155
click to vote
FMOODS
2007
15 years 6 months ago
2007
The success of distributed event-based infrastructures such as SIENA and Elvin is partially due to their ease of use. Even novice users of these infrastructures not versed in distr...
132
Voted
IJCAI
2001
15 years 6 months ago
2001
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
138
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...