2 citations · 2 across the 6 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2018
Order out of Chaos: Proving Linearizability Using Local Views
Yotam M. Y. Feldman, Constantin Enea, Adam Morrison +2
Proving the linearizability of highly concurrent data structures, such as those using optimistic concurrency control, is a challenging task. The main difficulty is in reasoning abo…
cs.DC2018
Safe Privatization in Transactional Memory
Artem Khyzha, Hagit Attiya, Alexey Gotsman +1
Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often wou…