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
Parents
64
1–5 of 64
163
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 163
95

Chinese Academy of Sciences
Beijing, China
3 h-index
5 publications
327 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
3 h-index
7 publications
432 citations
Tsinghua University
Beijing, China
3 h-index
6 publications
226 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
5 publications
853 citations
Institute of Software
Beijing, China
3 h-index
5 publications
327 citations
University of Connecticut
Storrs, United States
2 h-index
2 publications
71 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
2 publications
184 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
288 citations
1–8 of 95
4 publications · 194 citations
4
h-index
3 publications · 108 citations
3
h-index
2 publications · 153 citations
2
h-index
2 publications · 133 citations
2
h-index
2 publications · 107 citations
2
h-index
1–5