Formal construction of a non-blocking concurrent queue algorithm (a case study in atomicity)

Journal of Universal Computer Science

Volumn 11, Issue 5, 2005, Pages 744-770

  Abrial, Jean Raymond ^a   Cansell, Dominique ^b  

^a ETH ZURICH   (Switzerland)

^b LORIA   (France)

Author keywords

Atomicity; Concurrency; Formal proof; Prover; Refinement

Indexed keywords

EID: 23844476751     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (9)

1. [Abr96] J.R. Abrial. The B Book - Assigning Programs to Meanings. Cambridge University Press, 1996. ISBN 0-521-49619-5.
2. [Abr03] J.R. Abrial. Event Based Sequential Program Development: Application to Constructing a Pointer Program. In Dino Mandrioli Keijiro Araki, Stefania Gnesi, editor, FME 2003: Formal Methods, volume 2805 of Lecture Notes in Computer Science, pages 51-74, Pisa, Sept 2003.
3. [AC03a] J.-R. Abrial and D. Cansell. Click'n'prove : Interactive proofs within set theory. In David Basin et Burkhart Wolff, editor, 16th International Conference on Theorem Proving in Higher Order Logics - TPhOLs'2003, Rome, Italy, volume 2758 of Lecture notes in Computer Science, pages 1-24. Springer, Sep 2003.
4. [AC03b] J.-R. Abrial and D. Cansell. Click'n'prove ("la balbulette"), Sep 2003. http://www.loria.fr/~cansell/cnp.htm.
5. [ACM03] J.-R. Abrial, D. Cansell, and D. Méry. A mechanically proved and incremental development of ieee 1394 tree identify protocol. Formal Aspects of Computing, 14(3):215-227, Apr 2003.
6. [Cle04] ClearSy. B4free. Feb 2004. http://www.b4free.com.
7. [DGLM04] S. Doherty, L. Groves, V. Luchangco, and M. 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 - FORTE 2004, 24th IFIP WG 6.1 International Conference, Madrid Spain, September 27-30, 2004, Proceedings, volume 3235 of lecture Notes in Computer Science, pages 97-114. Springer, 2004.
8. [MS96] M. M. Michael and M. L. Scott. Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms. In Proceedings of the 15th Symposium on Principles of Distributed Computing, pages 267-75, Philadelphia, Pennsylvania, May 1996.
9. [YS03] E. Yahav and M. Sagiv. Automatically verifying concurrent queue algorithms. In Byron Cook, Scott Stoller, and Willem Visser, editors, Electronic Notes in Theoretical Computer Science, volume 89. Elsevier, 2003.