4036 search results - page 494 / 808 » Formal Methods |
144
click to vote
CAV
2007
Springer
16 years 26 days 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 ...
134
click to vote
CAV
2007
Springer
16 years 26 days ago
2007
Springer
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototy...
163
click to vote
CAV
2007
Springer
16 years 26 days ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
195
click to vote
CAV
2007
Springer
16 years 26 days ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
174
click to vote
FMCAD
2007
Springer
16 years 25 days ago
2007
Springer
—Bus and interconnect protocols contain a few core operations (such as read and write transfers) whose behaviors interleave to form complex executions. Specifications of the cor...