Fixpoint Computation

Fixpoint Computation is a method in abstract interpretation that determines the least fixpoint of a monotonic function over an abstract domain to capture the invariant properties of program semantics.

347

Publications

18.5K

Citations

585

Authors

306

Institutions

Publications per year

2017–2026

27

Authors

585

  1. CZ
    Carlo Zaniolo

    University of California, Los Angeles, United States

    6 publications · 441 citations

    6

    h-index

  2. VS
    V. S. Subrahmanian

    University of Maryland, College Park, United States

    5 publications · 228 citations

    5

    h-index

  3. ZM
    Zohar Manna

    Stanford University, United States

    5 publications · 258 citations

    5

    h-index

  4. MV
    Manuel V. Hermenegildo

    Universidad Politécnica de Madrid, Spain

    5 publications · 144 citations

    5

    h-index

  5. HS
    Helmut Seidl

    Technical University of Munich, Germany

    5 publications · 141 citations

    5

    h-index

1–5 of 585

Venues

  1. Theory and Practice of Logic Programming

    14 publications · 392 citations

    12

    h-index

  2. Theoretical Computer Science

    11 publications · 315 citations

    10

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 11 publications · 236 citations

    10

    h-index

  4. 9

    h-index

  5. Journal of Functional Programming

    8 publications · 283 citations

    8

    h-index

1–5