Derivation of a Scalable Lock-Free Stack Algorithm

Electronic Notes in Theoretical Computer Science

Volumn 187, Issue , 2007, Pages 55-74

  Groves, Lindsay ^a   Colvin, Robert ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

abstract specification; Concurrent lock free stack; linearisable stack

Indexed keywords

ABSTRACT SPECIFICATION; CONCURRENT LOCK-FREE STACK; LINEARIZABLE STACK;

COMPUTER SIMULATION; MATHEMATICAL MODELS;

ALGORITHMS;

EID: 34447263556     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.08.044     Document Type: Article

References (16)

1. Back, R.-J. and J. von Wright, Trace refinement of action systems, in: International Conference on Concurrency Theory, 1994, pp. 367-384
2. Colvin, R. and L. Groves, Formal verification of an array-based nonblocking queue, in: ICECCS '05: Proceedings of the Internation Conference on Engineering of Complex Computer Systems (2005), pp. 92-101
3. Colvin, R. and L. Groves, Verification of a scalable lock-free stack algorithm, Computer Science Technical Report CS-TR-06-14, Victoria University of Wellington (2006). URL http://www.mcs.vuw.ac.nz/comp/Publications/CS-TR-06-14.abs.html
4. Crow, J., S. Owre, J. Rushby, N. Shankar and M. Srivas, A tutorial introduction to PVS, in: Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, Florida, 1995. URL http://www.csl.sri.com/papers/wift-tutorial/
5. de Roever W.-P., and Engelhardt K. Data Refinement Model-Oriented Proof methods and their Comparison (1998), Cambridge University Press (With the assistance of J. Coenen and K.-H. Buth and P. Gardiner and Y. Lakhnech and F. Stomp)
6. Hendler, D., N. Shavit and L. Yerushalmi, A scalable lock-free stack algorithm, in: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallel Algorithms, June 27-30, 2004, Barcelona, Spain, 2004, pp. 206-215
7. Herlihy, M., V. Luchangco and M. Moir, Obstruction-free synchronization: Double-ended queues as an example, in: ICDCS '03: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003), p. 522
8. Herlihy M.P., and Wing J.M. Linearizability: a correctness condition for concurrent objects. TOPLAS 12 (1990) 463-492
9. Lynch N.A. Distributed Algorithms (1996), Morgan Kaufmann
10. Lynch, N.A. and F.W. Vaandrager, Forward and backward simulations - part I: untimed systems., in: 135, Centrum voor Wiskunde en Informatica (CWI), ISSN 0169-118X, 1993 p. 35
11. Michael M.M., and Scott M.L. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. J. Parallel Distrib. Comput. 51 (1998) 1-26
12. Moir, M., Practical implementations of non-blocking synchronization primitives, in: Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, Santa Barbara, CA., 1997, pp. 219-228
13. Moir M., Nussbaum D., Shalev O., and Shavit N. Using elimination to implement scalable and lock-free fifo queues. Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures. (SPAA 2005) (2005) 253-262
14. Morgan C. Programming from Specifications. second edition (1994), Prentice Hall
15. R.K.Treiber, Systems Programming: Coping with Parallelism. RJ5118, Technical report, IBM Almaden Research Center (1986). URL http://domino.watson.ibm.com/library/CyberDig.nsf/Home
16. Spivey M. The Z Notation: A Reference Manual (1988), Prentice-Hall International second edition, 1992