-
1
-
-
22144442809
-
Verifying concurrent data structures by simulation
-
Eerke Boiten and John Derrick, editors, Proc. Refinement Workshop 2005 (REFINE 2005, 2) of, Guildford, UK, April, Elsevier
-
Robert Colvin, Simon Doherty, and Lindsay Groves. Verifying concurrent data structures by simulation. In Eerke Boiten and John Derrick, editors, Proc. Refinement Workshop 2005 (REFINE 2005), volume 137(2) of Electronic Notes in Theoretical Computer Science, Guildford, UK, April 2005. Elsevier.
-
(2005)
Electronic Notes in Theoretical Computer Science
, vol.137
-
-
Colvin, R.1
Doherty, S.2
Groves, L.3
-
3
-
-
46749135438
-
Verification of a scalable lock-free stack algorithm
-
CS-TR-06-14, Victoria University of Wellington, April
-
Robert Colvin and Lindsay Groves. Verification of a scalable lock-free stack algorithm. Computer Science Technical Report CS-TR-06-14, Victoria University of Wellington, April 2006.
-
(2006)
Computer Science Technical Report
-
-
Colvin, R.1
Groves, L.2
-
4
-
-
33749861750
-
-
Robert Colvin, Lindsay Groves, Victor Luchangco, and Mark Moir. Formal verification of a lazy concurrent list-based set algorithm. In Thomas Ball and Robert B. Jones, editors, CAV, 4144 of Lecture Notes in Computer Science, pages 475-488. Springer, 2006.
-
Robert Colvin, Lindsay Groves, Victor Luchangco, and Mark Moir. Formal verification of a lazy concurrent list-based set algorithm. In Thomas Ball and Robert B. Jones, editors, CAV, volume 4144 of Lecture Notes in Computer Science, pages 475-488. Springer, 2006.
-
-
-
-
5
-
-
0003341233
-
A tutorial introduction to PVS
-
Boca Raton, Florida, April
-
Judy Crow, Sam Owre, John Rushby, Natarajan Shankar, and Mandayam Srivas. A tutorial introduction to PVS. In Workshop on IndustrialStrength Formal Specification Techniques, Boca Raton, Florida, April 1995.
-
(1995)
Workshop on IndustrialStrength Formal Specification Techniques
-
-
Crow, J.1
Owre, S.2
Rushby, J.3
Shankar, N.4
Srivas, M.5
-
6
-
-
35048816017
-
-
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, FORTE2004 : Formal Techniques for Networked and Distributed Systems, 3235 of Lecture Notes in Computer Science, pages 97-114. Springer, 2004.
-
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, FORTE2004 : Formal Techniques for Networked and Distributed Systems, volume 3235 of Lecture Notes in Computer Science, pages 97-114. Springer, 2004.
-
-
-
-
7
-
-
8344241113
-
A scalable lock-free stack algorithm
-
Barcelona, Spain
-
Danny Hendler, Nir Shavit, and Lena Yerushalmi. A scalable lock-free stack algorithm. In SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallel Algorithms, June 27-30, 2004, Barcelona, Spain, pages 206-215, 2004.
-
(2004)
SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallel Algorithms, June 27-30, 2004
, pp. 206-215
-
-
Hendler, D.1
Shavit, N.2
Yerushalmi, L.3
-
8
-
-
27544489038
-
Nonblocking memory management support for dynamic-sized data structures
-
Maurice Herlihy, Victor Luchangco, Paul Martin, and Mark Moir. Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst., 23(2):146-196, 2005.
-
(2005)
ACM Trans. Comput. Syst
, vol.23
, Issue.2
, pp. 146-196
-
-
Herlihy, M.1
Luchangco, V.2
Martin, P.3
Moir, M.4
-
10
-
-
0025460579
-
Linearizability: A correctness condition for concurrent objects
-
Maurice P. Herlihy and Jeannette M. Wing. Linearizability: a correctness condition for concurrent objects. TOPLAS, 12(3):463-492, 1990.
-
(1990)
TOPLAS
, vol.12
, Issue.3
, pp. 463-492
-
-
Herlihy, M.P.1
Wing, J.M.2
-
12
-
-
0005336501
-
Forward and backward simulations: I. untimed systems
-
Nancy A. Lynch and Frits W. Vaandrager. Forward and backward simulations: I. untimed systems. Inf. Comput., 121 (2):214-233, 1995.
-
(1995)
Inf. Comput
, vol.121
, Issue.2
, pp. 214-233
-
-
Lynch, N.A.1
Vaandrager, F.W.2
-
13
-
-
0002477257
-
Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
-
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.
-
(1998)
J. Parallel Distrib. Comput
, vol.51
, Issue.1
, pp. 1-26
-
-
Michael, M.M.1
Scott, M.L.2
-
14
-
-
32144436278
-
Using elimination to implement scalable and lock-free fifo queues
-
Las Vegas, Nevada, USA, ACM Press
-
Mark Moir, Daniel Nussbaum, Ori Shalev, and Nir Shavit. Using elimination to implement scalable and lock-free fifo queues. In Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pages 253-262, Las Vegas, Nevada, USA, 2005. ACM Press.
-
(2005)
Proc. 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)
, pp. 253-262
-
-
Moir, M.1
Nussbaum, D.2
Shalev, O.3
Shavit, N.4
-
15
-
-
47949112548
-
-
R.K.Treiber. Systems Programming: Coping with Parallelism. RJ5118. Technical report, IBM Almaden Research Center, April 1986.
-
R.K.Treiber. Systems Programming: Coping with Parallelism. RJ5118. Technical report, IBM Almaden Research Center, April 1986.
-
-
-
|