147 search results - page 5 / 30 » Polynomial Fairness and Liveness |
CONCUR
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
CCS
2006
ACM
14 years 8 days ago
2006
ACM
We present a process algebraic intruder model for verifying a class of liveness properties of security protocols. For this class, the proposed intruder model is proved to be equiv...
CONCUR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
IFM
2005
Springer
14 years 2 months 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...