Modular verification of a non-blocking stack

ACM SIGPLAN Notices

Volumn 42, Issue 1, 2007, Pages 297-302

  Parkinson, Matthew ^a   Bornat, Richard ^b   O'Hearn, Peter ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MIDDLESEX UNIVERSITY   (United Kingdom)

^c QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Concurrency; Non blocking; Separation logic

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; FORMAL LOGIC; SPECIFICATIONS;

CONCURRENT ALGORITHM; NON-BLOCKING; SEPARATION LOGIC;

DATA PROCESSING;

EID: 33846556227     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1190215.1190261     Document Type: Conference Paper

References (12)

1. R. Bornat, C. Calcagno, P. W. O'Hearn, and M. J. Parkinson. Permission accounting in separation logic. In Proceedings of POPL, pages 259-270, 2005.
2. R. Bornat, C. Calcagno, and H. Yang. Variables as resource in Separation logic. In Proceedings of MFPS XXI. Elsevier ENTCS, May 2005.
3. P. Brinch Hansen, editor. The Origin of Concurrent Programming. Springer-Verlag, 2002.
4. S. Brookes. A semantics for concurrent separation logic. Invited paper, in Proceedings of CONCUR, 2004.
5. E. W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming Languages, pages 43-112. Academic Press, 1968. Reprinted in [3].
6. T. Harris, S. Marlow, S. Peyton-Jones, and M. P. Herlihy. Composable memory transactions. In Proceedings of PPOPP, 2005.
7. M. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990.
8. M. P. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. In ISCA '93: Proceedings of the 20th annual international symposium on Computer architecture, pages 289-300, 1993.
9. C. B. Jones. Specification and design of (parallel) programs. In IFIP Congress, pages 321-332, 1983.
10. M. M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst., 15(6):491-504, 2004.
11. P. W. O'Hearn. Resources, concurrency and local reasoning. To appear in Theoretical Computer Science; preliminary version in CONCUR'04.
12. V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro. Proving correctness of highly-concurrent linearisable objects. In Proceedings of PPoPP, pages 129-136, 2006.