A general technique for proving lock-freedom
- 1 January 2009
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 74 (3) , 143-165
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Proving Linearizability Via Non-atomic Refinement2007
- Verifying Lock-Freedom Using Well-Founded Orders2007
- A general lock-free algorithm using compare-and-swapInformation and Computation, 2006
- Formal Verification of a Practical Lock-Free Queue Algorithm2004
- Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory MultiprocessorsJournal of Parallel and Distributed Computing, 1998
- A discipline of multiprogrammingACM Computing Surveys, 1996
- Verification of temporal propertiesJournal of Logic and Computation, 1996
- A logical approach to discrete mathChoice Reviews Online, 1994
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Parallel program design: a foundation: Chandry, K M and Misra, J Addison-Wesley, Wokingham, UK (1988) £19.95 pp 516Microprocessors and Microsystems, 1989