Invariant Checking

Invariant Checking is a formal verification method that belongs to the class of model checking techniques, specifically characterized by the systematic validation of logical assertions that must hold true across all reachable states of a concurrent system to ensure correctness during parallel debugging.

154

Publications

6.1K

Citations

365

Authors

170

Institutions

Publications per year

2017–2026

21

Authors

365

  1. BJ
    Bart Jacobs

    Radboud University Nijmegen, Netherlands

    4 publications · 82 citations

    4

    h-index

  2. AL
    Axel Legay

    Institut national de recherche en sciences et technologies du numérique, France

    4 publications · 129 citations

    4

    h-index

  3. MD
    Michael D. Ernst

    University of Washington, United States

    4 publications · 1.2K citations

    4

    h-index

  4. SB
    Saddek Bensalem

    Verimag, France

    4 publications · 129 citations

    4

    h-index

  5. YA
    Yanhong A. Liu

    Stony Brook University, United States

    3 publications · 41 citations

    3

    h-index

1–5 of 365

Venues

  1. ACM SIGPLAN Notices

    4 publications · 115 citations

    4

    h-index

  2. Theoretical Computer Science

    4 publications · 201 citations

    4

    h-index

  3. Formal Methods in System Design

    4 publications · 116 citations

    4

    h-index

  4. Software Testing Verification and Reliability

    STVR · 3 publications · 87 citations

    3

    h-index

  5. Electronic Notes in Theoretical Computer Science

    ENTCS · 3 publications · 61 citations

    3

    h-index

1–5