V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro. Proving correctness of highlyconcurrent linearisable objects. In Proc. Symp. on Principles and Practice of Parallel Programming. ACM Press, 2006. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Marriage of Rely/Guarantee and Separation - Logic Viktor Vafeiadis Self-citation (Vafeiadis) (Correct)
No context found.
V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro. Proving correctness of highlyconcurrent linearisable objects. In Proc. Symp. on Principles and Practice of Parallel Programming. ACM Press, 2006.
A Lazy Concurrent List-Based Set Algorithm - Heller, Herlihy, Luchangco.. (2005) Self-citation (Herlihy) (Correct)
No context found.
V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro. Proving correctness of highlyconcurrent linearisable objects. Technical report, Microsoft Research, Cambridge, UK, 2005.
Exploiting Linearizability in Program Logics" has been - Superseded By The (Correct)
No context found.
V. Vafeiadis, M. Herlihy, T. Hoare, and M. Shapiro. Proving correctness of highly-concurrent linearisable objects. In Proceedings of PPoPP, pages 129--136, 2006.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC