Symbolic Model Checking

Symbolic Model Checking is a method within model checking that uses symbolic representations, typically ordered binary decision diagrams, to efficiently explore and verify the state space of concurrent systems without explicit enumeration.

483

Publications

34.8K

Citations

980

Authors

391

Institutions

Publications per year

2017–2026

55

Authors

980

  1. EM
    E. M. Clarke

    Carnegie Mellon University, United States

    20 publications · 5.8K citations

    18

    h-index

  2. AC
    Alessandro Cimatti

    Fondazione Bruno Kessler, Italy

    20 publications · 2.8K citations

    16

    h-index

  3. EM
    Edmund M. Clarke

    Carnegie Mellon University, United States

    12 publications · 2.3K citations

    11

    h-index

  4. TA
    Thomas A. Henzinger

    University of California, Berkeley, United States

    12 publications · 4.1K citations

    11

    h-index

  5. KL
    Kenneth L. McMillan

    Carnegie Mellon University, United States

    11 publications · 5.4K citations

    11

    h-index

1–5 of 980

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 23 publications · 590 citations

    14

    h-index

  2. 13

    h-index

  3. 7

    h-index

  4. Science of Computer Programming

    7 publications · 226 citations

    7

    h-index

  5. IEEE Transactions on Software Engineering

    TSE · 6 publications · 678 citations

    6

    h-index

1–5