149 search results - page 1 / 30 » SAT-based Unbounded Model Checking of Timed Automata |
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
ACSD
2007
IEEE
13 years 6 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
CAV
2003
Springer
13 years 10 months ago
2003
Springer
FUIN
2006
13 years 4 months ago
2006
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
CAV
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...