Bounded Model Checking

Bounded Model Checking is a model checking technique that systematically explores bounded execution paths of a system by translating reachability properties into propositional logic formulas to detect property violations within a specified depth.

327

Publications

12.5K

Citations

650

Authors

273

Institutions

Publications per year

2017–2026

47

Authors

650

  1. LC
    Lucas C. Cordeiro

    Universidade Federal do Amazonas, Brazil

    22 publications · 1K citations

    17

    h-index

  2. WP
    Wojciech Penczek

    Institute of Computer Science, Poland

    14 publications · 630 citations

    13

    h-index

  3. DK
    Daniel Kroening

    University of Oxford, United Kingdom

    14 publications · 624 citations

    12

    h-index

  4. AL
    Alessio Lomuscio

    Imperial College London, United Kingdom

    11 publications · 486 citations

    11

    h-index

  5. AG
    Aarti Gupta

    Princeton University, United States

    12 publications · 387 citations

    11

    h-index

1–5 of 650

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 23 publications · 1.2K citations

    17

    h-index

  2. Fundamenta Informaticae

    7 publications · 152 citations

    7

    h-index

  3. 6

    h-index

  4. Design, Automation, and Test in Europe

    Conference · 6 publications · 131 citations

    6

    h-index

  5. Formal Methods in System Design

    5 publications · 220 citations

    5

    h-index

1–5