261 search results - page 49 / 53 » Formal Proof from UML Models |
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
PKC
2010
Springer
14 years 16 days ago
2010
Springer
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
At ASIACRYPT 2006, Chang et al. analyzed the indifferentiability of some popular hash functions based on block ciphers, namely, the twenty collision resistant PGV, the MDC2 and th...
DC
2007
13 years 8 months ago
2007
We present a randomizedself-stabilizing leaderelection protocol and a randomizedself-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirect...