Disjunctive Completion

Disjunctive Completion is a formal method in abstract interpretation that extends an abstract domain to explicitly represent disjunctions of abstract elements, thereby enabling more precise analysis of programs with branching behavior by capturing multiple execution paths separately.

9

Publications

216

Citations

20

Authors

13

Institutions

Publications per year

2017–2026

1

Authors

20

  1. YL
    Yuliya Lierler

    University of Nebraska at Omaha, United States

    2 publications · 66 citations

    2

    h-index

  2. MA
    Mario Alviano

    University of Calabria, Italy

    1 publications · 14 citations

    1

    h-index

  3. BS
    Bin Sun

    Chinese Academy of Sciences, China

    1 publications · 18 citations

    1

    h-index

  4. AM
    Antoine Miné

    École Normale Supérieure - PSL, France

    1 publications · 16 citations

    1

    h-index

  5. RG
    Roberto Giacobazzi

    University of Verona, Italy

    1 publications · 51 citations

    1

    h-index

1–5 of 20

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 1 publications · 16 citations

    1

    h-index

  2. 1

    h-index

  3. 1

    h-index

  4. PLoS ONE

    1 publications · 18 citations

    1

    h-index

  5. The Journal of Logic Programming

    1 publications · 11 citations

    1

    h-index

1–5