29 search results - page 6 / 6 » Specifying and verifying interaction protocols in a temporal... |
BIRTHDAY
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
WWW
2002
ACM
14 years 6 months ago
2002
ACM
HTML documents composed of frames can be difficult to write correctly. We demonstrate a technique that can be used by authors manually creating HTML documents (or by document edit...
JACM
2002
13 years 5 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
SIGSOFT
2007
ACM
14 years 6 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...