Trace-based derivation of a scalable lock-free stack algorithm

Formal Aspects of Computing

Volumn 21, Issue 1-2, 2009, Pages 187-223

  Groves, Lindsay ^a   Colvin, Robert ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; DATA STRUCTURES;

ABSTRACT MODELS; ABSTRACT SPECIFICATIONS; ALGORITHMIC IDEAS; BARCELONA , SPAIN; DATA REFINEMENTS; ELIMINATION PROCESS; LOCK-FREE; MEMORY MANAGEMENTS; MULTIPLE PAIRS; REDUCTION METHODS; REFACTORING; STACK ALGORITHMS; STACK IMPLEMENTATIONS;

PARALLEL ALGORITHMS;

EID: 59449085080     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-008-0092-5     Document Type: Article

References (42)

1. J-R Abrial D Cansell 2005 Formal construction of a non-blocking concurrent queue algorithm J Univ Comput Sci 11 5 744 770
2. Back R-J (1989) A method for refining atomicity in parallel algorithms. In: PARLE'89 conference on parallel architectures and languages Europe, vol 366 of lecture notes in computer science, Eindhoven, the Netherlands. Springer, New York, pp 199-216
3. RJR Back F Kurki-Suonio 1988 Distributed cooperation with action systems ACM Trans Program Lang Syst 10 4 513 554
4. Back R-J, von Wright J (1994) Trace refinement of action systems. In: International conference on concurrency theory, Uppsala, Sweden, August 22-25, pp 367-384
5. Back R-J, von Wright J (1998) Refinement calculus: a systematic introduction. Graduate texts in computer science. Springer, New York
6. R-J Back J von Wright 2000 Encoding, decoding and data refinement Formal Asp Comput 12 5 313 349
7. Colvin R, Groves L (2005) Formal verification of an array-based nonblocking queue. In: ICECCS '05: Proceedings of the internation conference on engineering of complex computer systems, New York, NY, USA. ACM Press, New York, pp 92-101
8. Colvin R, Groves L (2007) A scalable lock-free stack algorithm and its verification. In: 5th IEEE international conference on software engineering and formal methods (SEFM 2007), London, UK, 10-14 September 2007. IEEE Computer Society, Los Alamitos, CA, USA, pp 339-348
9. Crow J, Owre S, Rushby J, Shankar N, Srivas M (1995) A tutorial introduction to PVS. In: Workshop on industrial-strength formal specification techniques, Boca Raton, Florida
10. J Derrick E Boiten 2003 Relational concurrent refinement Formal Asp Comput 15 2 182 214
11. Doherty S, Groves L, Luchangco V, Moir M (2004) Formal verification of a practical lock-free queue algorithm. In: de Frutos-Escrig D, Núñez M (eds) FORTE2004: formal techniques for networked and distributed systems, vol 3235 of lecture notes in computer science. Springer, New York, pp 97-114
12. Doherty S, Herlihy M, Luchangco V, Moir M (2004) Bringing practical lock-free synchronization to 64-bit applications. In: PODC '04: proceedings of the twenty-third annual ACM symposium on principles of distributed computing, New York, NY, USA. ACM, New York, pp 31-39
13. J Dingel 2002 A refinement calculus for shared-variable parallel and distributed programming Formal Asp Comput 14 2 123 197
14. Detlefs DL, Martin PA, Moir M, Steele GL Jr (2001) Lock-free reference counting. In: Proceedings of the 20th annual ACM symposium on principles of distributed computing, Newport, Rhode Island, USA, August 26-29
15. de Roever W-P, Engelhardt K (1998) Data refinement model-oriented proof methods and their comparison. Cambridge University Press, London (with the assistance of J. Coenen, K.-H. Buth, P. Gardiner, Y. Lakhnech, F. Stomp)
16. Flanagan C, Freund S (2004) Atomizer: a dynamic atomicity checker for multithreaded programs. In: Proc. 31st ACM SIGPLAN-SIGACT symposium on principles of programming languages (POPL), Venice, Italy, January 14-16, pp 256-267
17. Flanagan C, Qadeer S (2003) A type and effect system for atomicity. In: Proc. ACM SIGPLAN conference on programming language design and implementation, San Diego, California, USA, June 9-11, pp 338-349
18. SN Freund S Qadeer 2005 Exploiting purity for atomicity IEEE Trans Softw Eng 31 4 275 291
19. L Groves R Colvin 2007 Derivation of a scalable lock-free stack algorithm Electron Notes Theor Comput Sci 187 55 74
20. Groves L (2007) Reasoning about nonblocking concurrency using reduction. In: ICECCS '07: proceedings of the 12th IEEE international conference on engineering complex computer systems (ICECCS 2007), Washington, DC, USA. IEEE Computer Society, pp 107-116
21. M Herlihy 1991 Wait-free synchronization ACM Trans Program Lang Syst 13 1 124 149
22. Herlihy M, Luchangco V, Moir M (2003) Obstruction-free synchronization: double-ended queues as an example. In: ICDCS '03: proceedings of the 23rd international conference on distributed computing systems. IEEE Computer Society, Los Alamitos, CA, USA, p 522
23. M Herlihy V Luchangco P Martin M Moir 2005 Nonblocking memory management support for dynamic-sized data structures ACM Trans Comput Syst 23 2 146 196
24. Hendler D, Shavit N, Yerushalmi L (2004) A scalable lock-free stack algorithm. In: SPAA 2004: proceedings of the sixteenth annual ACM symposium on parallel algorithms, 27-30 June 2004, Barcelona, Spain, pp 206-215
25. MP Herlihy JM Wing 1990 Linearizability: a correctness condition for concurrent objects ACM Trans Program Lang Syst 12 3 463 492
26. L Lamport 1988 Control predicates are better than dummy variables for reasoning about program control ACM Trans Program Lang Syst 10 2 267 281
27. RJ Lipton 1975 Reduction: a method of proving properties of parallel programs Commun ACM 18 12 717 721
28. Lamport L, Schneider FB (1989) Pretending atomicity. Technical Report TR89-1005, DEC, SRC
29. Lynch NA, Vaandrager FW (1993) Forward and backward simulations-part I: untimed systems. In: 135, Centrum voor Wiskunde en Informatica (CWI), ISSN 0169-118X, p 35
30. NA Lynch FW Vaandrager 1995 Forward and backward simulations: I Untimed systems. Inf Comput 121 2 214 233
31. Lynch NA (1996) Distributed algorithms. Morgan Kaufmann, Menlo Park
32. Morgan C, Gardiner PHB (1990) Data refinement by calculation. Acta Informatica 27(6):481-503 (reprinted in [MV93])
33. Moir M, Nussbaum D, Shalev O, Shavit N (2005) Using elimination to implement scalable and lock-free fifo queues. In: Proc. 17th annual ACM symposium on parallelism in algorithms and architectures (SPAA 2005), Las Vegas, Nevada, USA. ACM Press, New York, pp 253-262
34. Moir M (1997) Practical implementations of non-blocking synchronization primitives. In: Proceedings of the 15th annual ACM symposium on the principles of distributed computing, Santa Barbara, CA, pp 219-228
35. Morgan C (1994) Programming from specifications, 2nd edn. Prentice Hall, Englewood Cliffs
36. MM Michael ML Scott 1998 Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors J Parallel Distrib Comput 51 1 1 26
37. Morgan, C, Vickers, T (eds) (1993) On the refinement calculus. Springer, New York
38. S Owicki D Gries 1976 An axiomatic proof technique for parallel programs I Acta Informatica 6 319 340
39. Spivey M (1992) The Z notation: a reference manual, 2nd edn. Prentice-Hall, Englewood Cliffs
40. Treiber RK (1986) Systems programming: coping with parallelism. RJ5118. Technical report, IBM Almaden Research Center. http://domino.watson.ibm.com/ library/cyberdig.nsf/
41. L Wang SD Stoller 2006 Runtime analysis of atomicity for multithreaded programs IEEE Trans Softw Eng 32 2 93 110
42. Q Xu WP de Roever J He 1997 The rely-guarantee method for verifying shared variable concurrent programs Formal Asp Comput 9 2 149 174