Wait-free linearization with an assertional proof
- 1 October 1994
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 8 (2) , 65-80
- https://doi.org/10.1007/bf02280829
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On-the-fly garbage collection for several mutatorsDistributed Computing, 1992
- Loosely-coupled processes (preliminary version)Published by Springer Nature ,1991
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- A methodology for implementing highly concurrent data structuresACM SIGPLAN Notices, 1990
- Parallel Program DesignPublished by Springer Nature ,1989
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- The ``Hoare Logic'' of CSP, and All ThatACM Transactions on Programming Languages and Systems, 1984
- The ?Hoare logic? of concurrent programsActa Informatica, 1980
- An axiomatic proof technique for parallel programs IActa Informatica, 1976