Sciweavers

3 search results - page 1 / 1
» Verifying Michael and Scott's Lock-Free Queue Algorithm usin...
Sort
View
CATS
2008
13 years 6 months ago
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...
Lindsay Groves
WDAG
2004
Springer
134views Algorithms» more  WDAG 2004»
13 years 10 months ago
An Optimistic Approach to Lock-Free FIFO Queues
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
Edya Ladan-Mozes, Nir Shavit
PPOPP
2009
ACM
14 years 6 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...