2514 search results - page 241 / 503 » The use of industrial-strength formal methods |
174
click to vote
CAV
2004
Springer
15 years 12 months ago
2004
Springer
The counterexamples produced by model checkers are often lengthy and difficult to understand. In practical verification, showing the existence of a (potential) bug is not enough: ...
185
click to vote
CAV
1998
Springer
15 years 10 months ago
1998
Springer
An implementation of an out-of-order processing unit based on Tomasulo's algorithm is formally verified using compositional model checking techniques. This demonstrates that f...
133
click to vote
SIGCSE
1998
ACM
15 years 10 months ago
1998
ACM
Through the use of interpreters it is possible to teach programming languages in an analytic way without the mathematical overhead associated with other formal methods. This is a ...
192
click to vote
CHARME
2001
Springer
15 years 10 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...
168
click to vote
AIPS
2008
15 years 9 months ago
2008
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...