359 search results - page 10 / 72 » On Complete Primitives for Fairness |
IFM
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
CTRS
1990
13 years 11 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
WETICE
2008
IEEE
14 years 1 months ago
2008
IEEE
Symmetric exchanges has been used for peer-to-peer resource allocation systems to maintain fairness among the number of resources that each peer contributes to the network. The pr...
EUROCRYPT
2010
Springer
14 years 5 days ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
AMAST
2008
Springer
13 years 9 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...