Compositional Verification

Compositional Verification is a formal verification methodology within the broader field of Concurrency Verification that decomposes the verification of a complex system into modular proofs of its individual components, thereby enabling scalable and reusable correctness arguments through the hierarchical composition of system properties.

478

Publications

20.6K

Citations

1.1K

Authors

407

Institutions

Publications per year

2017–2026

74

Authors

1.1K

  1. DD
    Derek Dreyer

    Max Planck Institute for Software Systems, Germany

    8 publications · 380 citations

    8

    h-index

  2. RM
    Robi Malik

    University of Waikato, New Zealand

    8 publications · 254 citations

    8

    h-index

  3. ZS
    Zhong Shao

    Yale University, United States

    8 publications · 393 citations

    8

    h-index

  4. TA
    Thomas A. Henzinger

    University of California, Berkeley, United States

    8 publications · 1.6K citations

    7

    h-index

  5. CH
    Chung-Kil Hur

    Seoul National University, South Korea

    6 publications · 343 citations

    6

    h-index

1–5 of 1.1K

Venues

  1. Proceedings of the ACM on Programming Languages

    PACMPL · 14 publications · 443 citations

    13

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 15 publications · 286 citations

    12

    h-index

  3. ACM SIGPLAN Notices

    11 publications · 382 citations

    11

    h-index

  4. 10

    h-index

  5. IEEE Transactions on Software Engineering

    TSE · 9 publications · 801 citations

    9

    h-index

1–5