Formal verification of an array-based nonblocking queue

Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS

Volumn , Issue , 2005, Pages 507-516

  Colvin, Robert ^a   Groves, Lindsay ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; THEOREM PROVING;

CONCURRENT BOUNDED QUEUE; FORMAL VERIFICATION;

FORMAL LOGIC;

EID: 27144545762     PISSN: 27708527     EISSN: 27708535     Source Type: Conference Proceeding    
DOI: 10.1109/iceccs.2005.49     Document Type: Conference Paper

References (14)

1. Judy Crow, Sam Owre, John Rushby, Natarajan Shankar, and Mandayam Srivas. A tutorial introduction to PVS. In Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, Florida, April 1995.
2. Simon Doherty. Modelling and verifying non-blocking algorithms that use dynamically allocated memory. Master's thesis, School of Mathematical and Computing Sciences, Victoria University of Wellington, 2003.
3. Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul A. Martin, Mark Moir, Nir Shavit, and Guy L. Steele Jr. DCAS is not a silver bullet for nonblocking algorithm design. In Phillip B. Gibbons and Micah Adler, editors, Proceedings of the Sixteenth Annual ACM Symposium on Parallel Algorithms, pages 216-224. ACM, 2004.
4. Simon Doherty, Lindsay Groves, Victor Luchangco, and Mark Moir. Formal verification of a practical lock-free queue algorithm. In David de Frutos-Escrig and Manuel Núñez, editors, Formal Techniques for Networked and Distributed Systems, volume 3235 of Lecture Notes in Computer Science, pages 97-114. Springer, 2004.
5. Maurice Herlihy, Victor Luchangco, and Mark Moir. Obstruction-free synchronization: Double-ended queues as an example. In ICDCS '03: Proceedings of the 23rd International Conference on Distributed Computing Systems, page 522. IEEE Computer Society, 2003.
6. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: a correctness condition for concurrent objects. TOPLAS, 12(3):463-492, 1990.
7. Gerard J. Holzmann. The model checker SPIN. IEEE Trans. Softw. Eng., 23(5):279-295, 1997.
8. William N. Scherer III and Michael L. Scott. Nonblocking concurrent data structures with condition synchronization. In Rachid Guerraoui, editor, DISC, volume 3274 of Lecture Notes in Computer Science, pages 174-187. Springer, 2004.
9. Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
10. Nancy A. Lynch and Frits W. Vaandrager. Forward and backward simulations - part I: untimed systems. In 135, page 35. Centrum voor Wiskunde en Informatica (CWI), ISSN 0169-118X, 31 1993.
11. Maged M. Michael and Michael L. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. J. Parallel Distrib. Comput., 51(1):1-26, 1998.
12. Mark Moir. Practical implementations of non-blocking synchronization primitives. In Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, Santa Barbara, CA., August 1997.
13. Chien-Hua Shann, Ting-Lu Huang, and Cheng Chen. A practical nonblocking queue algorithm using compare-and-swap. In Seventh International Conference on Parallel and Distributed Systems (ICPADS'00), pages 470-475, 2000.
14. Nir Shavit and Mark Moir. Concurrent data structures. In Dinesh Mehta and Sartaj Sahni, editors, Handbook of Data Structures and Applications. Chapman & Hall/CRC Press, 2004.