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
Parents
22
Compositional dynamic test generation
Patrice Godefroid · ACM SIGPLAN Notices · 2007 · 411 citations
Compositional dynamic test generation
Patrice Godefroid · 2007 · 311 citations
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 22
37
3
h-index
2
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
2 publications · 133 citations
2
h-index
2
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
2 publications · 133 citations
2
h-index
1–5 of 37
22

Chinese Academy of Sciences
Beijing, China
4 h-index
7 publications
290 citations
Institute of Software
Beijing, China
4 h-index
6 publications
273 citations
Microsoft (Finland)
Espoo, Finland
2 h-index
6 publications
123 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
2 publications
184 citations
University of Bahrain
Madīnat ‘Īsá, Bahrain
2 h-index
2 publications
42 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
2 publications
722 citations
University of California San Diego
San Diego, United States
2 h-index
2 publications
184 citations
Microsoft (United States)
Redmond, United States
2 h-index
4 publications
498 citations
1–8 of 22
3 publications · 536 citations
3
h-index
SEN · 2 publications · 70 citations
2
h-index
PACMPL · 1 publications · 79 citations
1
h-index
STVR · 1 publications · 14 citations
1
h-index
OR · 1 publications · 22 citations
1
h-index
1–5