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
32
Pinpoint: fast and precise sparse value flow analysis for million lines of code
Qingkai Shi, Xiao Xiao, Rongxin Wu et al. · 2018 · 115 citations
Ranjit Jhala, Rupak Majumdar · ACM SIGPLAN Notices · 2005 · 107 citations
1–5 of 32
74
Hong Kong University of Science and Technology, Hong Kong SAR China
3 publications · 155 citations
3
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
3 publications · 155 citations
3
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
3 publications · 155 citations
3
h-index
2
h-index
2
h-index
1–5 of 74
38

Chinese Academy of Sciences
Beijing, China
3 h-index
5 publications
327 citations
Institute of Software
Beijing, China
3 h-index
5 publications
327 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
11 publications
598 citations
University of Pittsburgh
Pittsburgh, United States
2 h-index
2 publications
220 citations
Microsoft (Finland)
Espoo, Finland
2 h-index
6 publications
123 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
440 citations
University of Technology Sydney
Sydney, Australia
2 h-index
2 publications
36 citations

University of Liverpool
Liverpool, United Kingdom
2 h-index
4 publications
212 citations
1–8 of 38
SEN · 3 publications · 110 citations
3
h-index
2 publications · 125 citations
2
h-index
Repository · 1 publications · 16 citations
1
h-index
IJSEKE · 1 publications · 80 citations
1
h-index
1 publications · 32 citations
1
h-index
1–5