Path Feasibility Analysis

Path Feasibility Analysis is a static analysis technique within control-flow analysis that determines whether a given execution path in a program can be realized under feasible program inputs and constraints, thereby distinguishing paths that are theoretically possible from those that are computationally unreachable.

32

Publications

1.5K

Citations

74

Authors

38

Institutions

Publications per year

2017–2026

7

Variants

Feasible Path Analysis

Authors

74

  1. QS
    Qingkai Shi

    Hong Kong University of Science and Technology, Hong Kong SAR China

    3 publications · 155 citations

    3

    h-index

  2. CZ
    Charles Zhang

    Hong Kong University of Science and Technology, Hong Kong SAR China

    3 publications · 155 citations

    3

    h-index

  3. RW
    Rongxin Wu

    Hong Kong University of Science and Technology, Hong Kong SAR China

    3 publications · 155 citations

    3

    h-index

  4. RM
    Robert M. Hierons

    Brunel University of London, United Kingdom

    2 publications · 130 citations

    2

    h-index

  5. RM
    Rupak Majumdar

    Max Planck Institute for Software Systems, Germany

    2 publications · 184 citations

    2

    h-index

1–5 of 74

Venues

  1. ACM SIGSOFT Software Engineering Notes

    SEN · 3 publications · 110 citations

    3

    h-index

  2. ACM SIGPLAN Notices

    2 publications · 125 citations

    2

    h-index

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

    Repository · 1 publications · 16 citations

    1

    h-index

  4. 1

    h-index

  5. American Journal of Medical Genetics Part A

    1 publications · 32 citations

    1

    h-index

1–5