Sciweavers

372 search results - page 50 / 75
» Model Checking Commitment Protocols
Sort
View
IWFM
2000
107views Formal Methods» more  IWFM 2000»
13 years 10 months ago
A Comparison of Three Model Checkers Applied to a Distributed Database Problem
ct Increasingly, model checking is being applied to more abstract problem domains than the traditional protocol analysis. The extent to which such an approach is able to provide us...
A. J. Currie
ATAL
2004
Springer
14 years 2 months ago
Preferences in Game Logics
We introduce a Game Logic with Preferences (GLP), which makes it possible to reason about how information or assumptions about the preferences of other players can be used by agen...
Sieuwert van Otterloo, Wiebe van der Hoek, Michael...
FAC
2008
178views more  FAC 2008»
13 years 8 months ago
Modeling and validating Mondex scenarios described in UML and OCL with USE
This paper describes the Mondex case study with UML class diagrams and restricting OCL constraints. The constraints have been formulated either as OCL class invariants or as OCL pr...
Mirco Kuhlmann, Martin Gogolla
ICALP
2003
Springer
14 years 1 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 9 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous