1895 search results - page 50 / 379 » Using ATL for Checking Models |
142
Voted
CHARME
2001
Springer
15 years 6 months ago
2001
Springer
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...
150
Voted
ASIAN
2003
Springer
15 years 7 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
124
click to vote
FM
2003
Springer
15 years 7 months ago
2003
Springer
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
126
click to vote
QEST
2007
IEEE
15 years 8 months ago
2007
IEEE
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
149
click to vote
ICST
2009
IEEE
15 years 2 days ago
2009
IEEE
Under certain constraints the test case generation problem can be represented as a model checking problem, thus enabling the use of powerful model checking tools to perform the te...