Concurrent Data Structure Verification
Concurrent Data Structure Verification is a formal method for proving the correctness of shared-memory data structures with respect to linearizability or other consistency criteria under the concurrent access and modification by multiple threads.
34
Publications
1.7K
Citations
62
Authors
31
Institutions
Publications per year
2017–2026
10
Parents
34
Peter Sewell, Susmit Sarkar, Scott Owens et al. · Communications of the ACM · 2010 · 457 citations
Modular fine-grained concurrency verification
Viktor Vafeiadis · 2021 · 147 citations · Full text
Concurrent search structure algorithms
Dennis Shasha, Nathan Goodman · ACM Transactions on Database Systems · 1988 · 118 citations · Full text
Proving that non-blocking algorithms don't block
Alexey Gotsman, Byron Cook, Matthew Parkinson et al. · 2009 · 71 citations
1–5 of 34
62
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 62
31
University of Cambridge
Cambridge, United Kingdom
5 h-index
10 publications
2.1K citations
Microsoft (United States)
Redmond, United States
4 h-index
5 publications
235 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
4 h-index
6 publications
218 citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
3 h-index
6 publications
380 citations
Koç University
Istanbul, Türkiye
3 h-index
5 publications
170 citations
University of Washington
Seattle, United States
2 h-index
5 publications
83 citations

University of Twente
Enschede, The Netherlands
2 h-index
6 publications
120 citations

Paderborn University
Paderborn, Germany
2 h-index
2 publications
58 citations
1–8 of 31
5 publications · 144 citations
5
h-index
PACMPL · 2 publications · 26 citations
2
h-index
ENTCS · 2 publications · 64 citations
2
h-index
TACO · 1 publications · 10 citations
1
h-index
1 publications · 457 citations
1
h-index
1–5