598 search results - page 38 / 120 » Efficient and User-Friendly Verification |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing ...
CAV
1998
Springer
15 years 1 months ago
1998
Springer
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...