2473 search results - page 260 / 495 » The Logic of Communication Graphs |
195
click to vote
TCC
2004
Springer
16 years 7 hour ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
151
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
—We present a new language called Precision Timed C, for predictable and lightweight multithreading in C. PRET-C supports synchronous concurrency, preemption, and a high-level co...
166
click to vote
EUROSYS
2010
ACM
15 years 11 months ago
2010
ACM
Combining access control with weakly consistent replication presents a challenge if the resulting system is to support eventual consistency. If authorization policy can be tempora...
174
click to vote
APLAS
2000
ACM
15 years 11 months ago
2000
ACM
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
162
click to vote
EUROPAR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...