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

Authors

62

  1. AT
    Aaron Turon

    Max Planck Institute for Software Systems, Germany

    4 publications · 218 citations

    4

    h-index

  2. VV
    Viktor Vafeiadis

    Max Planck Institute for Software Systems, Germany

    4 publications · 266 citations

    4

    h-index

  3. ST
    Serdar Taşiran

    Koç University, Türkiye

    3 publications · 93 citations

    3

    h-index

  4. MP
    Matthew Parkinson

    University of Cambridge, United Kingdom

    3 publications · 106 citations

    3

    h-index

  5. SQ
    Shaz Qadeer

    Microsoft (United States), United States

    3 publications · 93 citations

    3

    h-index

1–5 of 62

Venues

  1. ACM SIGPLAN Notices

    5 publications · 144 citations

    5

    h-index

  2. Proceedings of the ACM on Programming Languages

    PACMPL · 2 publications · 26 citations

    2

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 64 citations

    2

    h-index

  4. ACM Transactions on Architecture and Code Optimization

    TACO · 1 publications · 10 citations

    1

    h-index

  5. Communications of the ACM

    1 publications · 457 citations

    1

    h-index

1–5