Sciweavers

441 search results - page 39 / 89
» A Method for Proving Observational Equivalence
Sort
View
INFOCOM
2008
IEEE
14 years 3 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
CSFW
2006
IEEE
14 years 2 months ago
Coercion-Resistance and Receipt-Freeness in Electronic Voting
In this paper we formally study important properties of electronic voting protocols. In particular we are interested in coercion-resistance and receipt-freeness. Intuitively, an e...
Stéphanie Delaune, Steve Kremer, Mark Ryan
CALCO
2005
Springer
109views Mathematics» more  CALCO 2005»
14 years 2 months ago
Final Semantics for Event-Pattern Reactive Programs
Event-pattern reactive programs are front-end programs for distributed reactive components that preprocess an incoming stream of event stimuli. Their purpose is to recognize tempor...
César Sánchez, Henny B. Sipma, Matte...
ICLP
2003
Springer
14 years 2 months ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia
ITP
2010
159views Mathematics» more  ITP 2010»
14 years 23 days ago
Programming Language Techniques for Cryptographic Proofs
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
Gilles Barthe, Benjamin Grégoire, Santiago ...