61 citations · 124 across the 15 of their papers we have counts for
3 papers · 1 filter
An Algorithmic Approach to the Asynchronous Computability Theorem
Vikram Saraph, Maurice Herlihy, Eli Gafni
The asynchronous computability theorem (ACT) uses concepts from combinatorial topology to characterize which tasks have wait-free solutions in read-write memory. A task can be expr…
Adding Concurrency to Smart Contracts
Thomas Dickerson, Paul Gazzillo, Maurice Herlihy +1
Modern cryptocurrency systems, such as Ethereum, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times,…
Proust: A Design Space for Highly-Concurrent Transactional Data Structures
Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy +1
Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and…