212
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
179
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
: Analyzing Consistency Properties for Fun and Profit Wojciech Golab, Xiaozhou Li, Mehul A. Shah HP Laboratories HPL-2011-6 data consistency, algorightms, key-value stores Moti...
293
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
172
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
We put forward a general theory of goal-oriented communication, where communication is not an end in itself, but rather a means to achieving some goals of the communicating partie...
306
click to vote
PLPV
2011
ACM
14 years 10 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...