Feasibility Checking

Feasibility Checking is a symbolic execution method that determines whether a given program path is achievable under the program’s constraints by verifying the satisfiability of the accumulated path conditions using constraint solvers.

64

Publications

3.8K

Citations

163

Authors

95

Institutions

Publications per year

2017–2026

8

Authors

163

  1. RM
    Rupak Majumdar

    Max Planck Institute for Software Systems, Germany

    4 publications · 385 citations

    4

    h-index

  2. LN
    Laurent Nana

    Université de Bretagne Occidentale, France

    2 publications · 341 citations

    2

    h-index

  3. FS
    Frank Singhoff

    Université de Bretagne Occidentale, France

    2 publications · 341 citations

    2

    h-index

  4. HL
    Hongbin Li

    Stevens Institute of Technology, United States

    2 publications · 45 citations

    2

    h-index

  5. NG
    Neelam Gupta

    University of Arizona, United States

    2 publications · 220 citations

    2

    h-index

1–5 of 163

Venues

  1. IEEE Transactions on Power Systems

    4 publications · 194 citations

    4

    h-index

  2. Operations Research

    3 publications · 108 citations

    3

    h-index

  3. ACM SIGPLAN Notices

    2 publications · 153 citations

    2

    h-index

  4. Automatica

    2 publications · 133 citations

    2

    h-index

  5. Operations Research Letters

    2 publications · 107 citations

    2

    h-index

1–5