Separation Logic

Separation Logic is a formal logical framework for reasoning about resource-sensitive computations by extending Hoare Logic with a separating conjunction that enables localized, compositional verification of programs that manipulate dynamically allocated memory.

292

Publications

14.8K

Citations

392

Authors

185

Institutions

Publications per year

2017–2026

84

Authors

392

  1. LB
    Lars Birkedal

    Aarhus University, Denmark

    33 publications · 1.6K citations

    20

    h-index

  2. PW
    Peter W. O’Hearn

    Queen Mary University of London, United Kingdom

    20 publications · 2.1K citations

    18

    h-index

  3. DD
    Derek Dreyer

    Max Planck Institute for Software Systems, Germany

    18 publications · 1.1K citations

    16

    h-index

  4. RK
    Robbert Krebbers

    Radboud University Nijmegen, Netherlands

    16 publications · 1K citations

    15

    h-index

  5. CC
    Cristiano Calcagno

    Imperial College London, United Kingdom

    17 publications · 1.8K citations

    14

    h-index

1–5 of 392

Venues

  1. Proceedings of the ACM on Programming Languages

    PACMPL · 41 publications · 1.3K citations

    21

    h-index

  2. ACM SIGPLAN Notices

    30 publications · 1.2K citations

    19

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 19 publications · 459 citations

    13

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 11 publications · 225 citations

    11

    h-index

  5. 9

    h-index

1–5