Verification Of Concurrent Programs

Verification of Concurrent Programs is a formal method in computer science that constitutes the systematic process of proving or disproving the correctness of intended algorithms or systems with respect to a certain property, specifically by analyzing all possible interleavings of concurrent operations to ensure consistent and predictable behavior under shared resource access and synchronization constraints.

413

Publications

30.4K

Citations

672

Authors

256

Institutions

Publications per year

2017–2026

57

Authors

672

  1. MB
    Matthew B. Dwyer

    University of Nebraska–Lincoln, United States

    11 publications · 606 citations

    11

    h-index

  2. SQ
    Shaz Qadeer

    Microsoft (United States), United States

    11 publications · 515 citations

    11

    h-index

  3. AP
    Amir Pnueli

    Weizmann Institute of Science, Israel

    10 publications · 7.2K citations

    10

    h-index

  4. XF
    Xinyu Feng

    University of Science and Technology of China, China

    10 publications · 511 citations

    10

    h-index

  5. LB
    Lars Birkedal

    Aarhus University, Denmark

    8 publications · 365 citations

    8

    h-index

1–5 of 672

Venues

  1. 16

    h-index

  2. ACM SIGPLAN Notices

    24 publications · 665 citations

    16

    h-index

  3. Proceedings of the ACM on Programming Languages

    PACMPL · 18 publications · 557 citations

    15

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 18 publications · 2.5K citations

    14

    h-index

  5. Electronic Notes in Theoretical Computer Science

    ENTCS · 15 publications · 335 citations

    12

    h-index

1–5