Sciweavers

11 search results - page 2 / 3
» On-the-Fly Model Checking of Fair Non-repudiation Protocols
Sort
View
JCS
2006
157views more  JCS 2006»
13 years 5 months ago
Analysis of probabilistic contract signing
We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the pr...
Gethin Norman, Vitaly Shmatikov
ATAL
2004
Springer
13 years 10 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...
HIPC
2007
Springer
13 years 9 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ACSD
2003
IEEE
103views Hardware» more  ACSD 2003»
13 years 10 months ago
Design Validation of ZCSP with SPIN
— We consider the problem of specifying a model of the Zero Copy Secured Protocol for the purpose of LTL verification with the SPIN Model Checker. ZCSP is based on Direct Memory...
Vincent Beaudenon, Emmanuelle Encrenaz, Jean Lou D...
DRM
2004
Springer
13 years 10 months ago
A DRM security architecture for home networks
This paper describes a security architecture allowing digital rights management in home networks consisting of consumer electronic devices. The idea is to allow devices to establi...
Bogdan C. Popescu, Bruno Crispo, Andrew S. Tanenba...