We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
Hyder supports reads and writes on indexed records within classical multi-step transactions. It is designed to run on a cluster of servers that have shared access to a large pool ...
Previous research in real-time concurrency control mainly focuses on the schedulability guarantee of hard real-time transactions and the reducing of the miss rate of soft real-tim...
Kam-yiu Lam, Tei-Wei Kuo, Ben Kao, Tony S. H. Lee,...
Distributed cooperative engineering applications require consistent and long-term sharing of large volumes of data, which may cause conflicts due to concurrent read/write operatio...
Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite ...