798 search results - page 72 / 160 » Proving More Properties with Bounded Model Checking |
158
click to vote
JSS
2010
14 years 11 months ago
2010
Architectural description languages are a useful tool for modeling complex systems at a high level of abstraction. If based on formal methods, they can also serve for enabling the...
179
click to vote
PODS
1994
ACM
15 years 8 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
133
click to vote
CHARME
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
121
click to vote
APSEC
2005
IEEE
15 years 10 months ago
2005
IEEE
We report on a case study in which the Maude model checker has been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion p...
126
click to vote
IJCAI
1993
15 years 5 months ago
1993
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...