24 search results - page 5 / 5 » Cryptographically-Sound Protocol-Model Abstractions |
OSDI
2002
ACM
14 years 5 months ago
2002
ACM
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
CHARME
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
ICFEM
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
FC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...