Predicate Abstraction

Predicate Abstraction is a formal method in program analysis that belongs to the class of abstract interpretation techniques, distinguished by its construction of an abstract state space through the logical interpretation of a finite set of predicates over program variables to approximate program semantics for verification purposes.

138

Publications

9.8K

Citations

225

Authors

108

Institutions

Publications per year

2017–2026

11

Authors

225

  1. RM
    Rupak Majumdar

    Max Planck Institute for Software Systems, Germany

    10 publications · 2.5K citations

    10

    h-index

  2. DB
    Dirk Beyer

    University of Passau, Germany

    9 publications · 714 citations

    9

    h-index

  3. RJ
    Ranjit Jhala

    University of California San Diego, United States

    8 publications · 1.6K citations

    8

    h-index

  4. TA
    Thomas A. Henzinger

    University of California, Berkeley, United States

    8 publications · 1.4K citations

    8

    h-index

  5. DK
    Daniel Kroening

    University of Oxford, United Kingdom

    8 publications · 497 citations

    8

    h-index

1–5 of 225

Venues

  1. ACM SIGPLAN Notices

    18 publications · 2.1K citations

    16

    h-index

  2. 3

    h-index

  3. IEEE Transactions on Software Engineering

    TSE · 3 publications · 360 citations

    3

    h-index

  4. Electronic Notes in Theoretical Computer Science

    ENTCS · 3 publications · 74 citations

    3

    h-index

  5. ArXiv.org

    Repository · 3 publications · 117 citations

    3

    h-index

1–5