Sciweavers

1472 search results - page 50 / 295
» On Model Checking Infinite-State Systems
Sort
View
156
Voted
COMPOS
1997
Springer
15 years 7 months ago
Compositional Reasoning in Model Checking
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parall...
Sergey Berezin, Sérgio Vale Aguiar Campos, ...
154
Voted
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
15 years 7 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan
152
Voted
FM
2003
Springer
115views Formal Methods» more  FM 2003»
15 years 8 months ago
Model Checking FTA
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
Andreas Thums, Gerhard Schellhorn
SIGPLAN
2002
15 years 3 months ago
On-the-fly model checking from interval logic specifications
Future Interval Logic (FIL) and its intuitive graphical representation, Graphical Interval Logic (GIL), can be used as the formal description language of model checking tools to v...
Miguel J. Hornos, Manuel I. Capel
109
Voted
SIGSOFT
2003
ACM
15 years 9 months ago
Evaluating and improving the automatic analysis of implicit invocation systems
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
Jeremy S. Bradbury, Jürgen Dingel