Sciweavers

1513 search results - page 51 / 303
» Fibonacci Correction Networks
Sort
View
PODC
1992
ACM
15 years 8 months ago
The Weakest Failure Detector for Solving Consensus
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [199...
Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toue...
AINA
2004
IEEE
15 years 8 months ago
Spi2Java: Automatic Cryptographic Protocol Java Code Generation from spi calculus
The aim of this work is to describe a tool (Spi2Java) that automatically generates Java code implementing cryptographic protocols described in the formal specification language sp...
Davide Pozza, Riccardo Sisto, Luca Durante
CCS
2008
ACM
15 years 6 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
ICDCSW
2011
IEEE
14 years 4 months ago
Cross-Examination of Datacenter Workload Modeling Techniques
Datacenter workload modeling has become a necessity in recent years due to the emergence of large-scale applications and cloud data-stores, whose implementation remains largely un...
Christina Delimitrou, Christos Kozyrakis
EMSOFT
2007
Springer
15 years 8 months ago
Necessary and sufficient conditions for deterministic desynchronization
Synchronous reactive formalisms associate concurrent behaviors to precise schedules on global clock(s). This allows a non-ambiguous notion of "absent" signal, which can ...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...