1472 search results - page 262 / 295 » On Model Checking Infinite-State Systems |
63
Voted
FOSSACS
2003
Springer
15 years 2 months ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
PKDD
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. In many applications of data mining a - sometimes considerable - part of the data values is missing. This may occur because the data values were simply never entered into...
118
click to vote
ATAL
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
EMSOFT
2006
Springer
15 years 1 months ago
2006
Springer
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...
101
Voted
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...