1397 search results - page 124 / 280 » On the Need for Practical Formal Methods |
CAV
2009
Springer
14 years 5 months ago
2009
Springer
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...
CAV
2007
Springer
14 years 4 months ago
2007
Springer
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
LCN
2005
IEEE
14 years 3 months ago
2005
IEEE
Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of n...
FMCO
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
CAV
2004
Springer
14 years 3 months ago
2004
Springer
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsification of properties that were not invariants. In this paper we propose a term...