Abstract Predicates

Abstract Predicates is a logical construct in Hoare Logic that denotes a predicate defined by its observable behavior under proof rules rather than by an explicit internal formula, enabling modular reasoning about program properties through abstraction.

83

Publications

6.9K

Citations

167

Authors

82

Institutions

Publications per year

2017–2026

13

Authors

167

  1. KL
    Kenneth L. McMillan

    Carnegie Mellon University, United States

    3 publications · 881 citations

    3

    h-index

  2. SJ
    Suresh Jagannathan

    Purdue University West Lafayette, United States

    3 publications · 157 citations

    3

    h-index

  3. RM
    Rupak Majumdar

    Max Planck Institute for Software Systems, Germany

    3 publications · 881 citations

    3

    h-index

  4. TA
    Thomas A. Henzinger

    University of California, Berkeley, United States

    3 publications · 881 citations

    3

    h-index

  5. MP
    Matthew Parkinson

    University of Cambridge, United Kingdom

    3 publications · 391 citations

    3

    h-index

1–5 of 167

Venues

  1. ACM SIGPLAN Notices

    6 publications · 746 citations

    6

    h-index

  2. Proceedings of the ACM on Programming Languages

    PACMPL · 3 publications · 42 citations

    3

    h-index

  3. 3

    h-index

  4. 1

    h-index

  5. Noûs

    1 publications · 96 citations

    1

    h-index

1–5