Sciweavers

458 search results - page 16 / 92
» Designing and executing protocols using the event calculus
Sort
View
JPDC
2006
111views more  JPDC 2006»
13 years 7 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
13 years 12 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
PODC
1994
ACM
13 years 11 months ago
A Checkpoint Protocol for an Entry Consistent Shared Memory System
Workstation clusters are becoming an interesting alternative to dedicated multiprocessors. In this environment, the probability of a failure, during an application's executio...
Nuno Neves, Miguel Castro, Paulo Guedes
SIMPRA
2008
131views more  SIMPRA 2008»
13 years 7 months ago
Distributed simulation of DEVS and Cell-DEVS models in CD++ using Web-Services
: DEVS is a Modeling and Simulation formalism that has been widely used to study the dynamics of discrete event systems. Cell-DEVS is a DEVS-based formalism that defines spatial mo...
Gabriel A. Wainer, Rami Madhoun, Khaldoon Al-Zoubi
TOPLAS
2010
101views more  TOPLAS 2010»
13 years 6 months ago
Nomadic pict: Programming languages, communication infrastructure overlays, and semantics for mobile computation
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
Peter Sewell, Pawel T. Wojciechowski, Asis Unyapot...