Program Path Feasibility

Program Path Feasibility is a symbolic execution predicate that determines whether a given sequence of program branches admits at least one concrete input assignment satisfying all associated path constraints, thereby distinguishing feasible execution paths from spurious ones.

22

Publications

1.6K

Citations

37

Authors

22

Institutions

Publications per year

2017–2026

4

Authors

37

  1. JZ
    Jian Zhang

    Institute of Software, China

    3 publications · 111 citations

    3

    h-index

  2. PG
    Patrice Godefroid

    Microsoft (United States), United States

    2 publications · 722 citations

    2

    h-index

  3. RW
    Rongxin Wu

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

    2 publications · 133 citations

    2

    h-index

  4. NM
    Nicos Malevris

    Athens University of Economics and Business, Greece

    2 publications · 106 citations

    2

    h-index

  5. CZ
    Charles Zhang

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

    2 publications · 133 citations

    2

    h-index

1–5 of 37

Venues

  1. ACM SIGPLAN Notices

    3 publications · 536 citations

    3

    h-index

  2. ACM SIGSOFT Software Engineering Notes

    SEN · 2 publications · 70 citations

    2

    h-index

  3. Proceedings of the ACM on Programming Languages

    PACMPL · 1 publications · 79 citations

    1

    h-index

  4. Software Testing Verification and Reliability

    STVR · 1 publications · 14 citations

    1

    h-index

  5. Journal of the Operational Research Society

    OR · 1 publications · 22 citations

    1

    h-index

1–5