Sciweavers

22 search results - page 5 / 5
» Probability and Nondeterminism in Operational Models of Conc...
Sort
View
FMICS
2009
Springer
13 years 11 months ago
A Rigorous Methodology for Composing Services
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
Kenneth J. Turner, Koon Leai Larry Tan
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 5 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah