Sciweavers

147 search results - page 1 / 30
» Polynomial Fairness and Liveness
Sort
View
CSFW
2002
IEEE
13 years 9 months ago
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
Michael Backes, Birgit Pfitzmann, Michael Steiner,...
CCS
2005
ACM
13 years 10 months ago
On fairness in simulatability-based cryptographic systems
Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simula...
Michael Backes, Dennis Hofheinz, Jörn Mü...
POPL
2009
ACM
14 years 5 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
MASCOTS
2001
13 years 6 months ago
On Class-Based Isolation of UDP, Short-Lived and Long-Lived TCP Flows
The congestion control mechanisms of TCP make it vulnerable in an environment where flows with different congestionsensitivity compete for scarce resources. With the increasing am...
Selma Yilmaz, Ibrahim Matta
CONCUR
2006
Springer
13 years 8 months ago
Liveness, Fairness and Impossible Futures
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
Rob J. van Glabbeek, Marc Voorhoeve