Path Constraint Solving
Path Constraint Solving is a computational method in symbolic execution that determines the satisfiability of symbolic path conditions to identify feasible execution paths through a program.
70
Publications
6.3K
Citations
174
Authors
93
Institutions
Publications per year
2017–2026
10
Parents
70
Koushik Sen, Darko Marinov, Gul Agha · 2005 · 1.7K citations
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski et al. · 2006 · 789 citations
Ingrid Bongartz, Andrew R. Conn, Philippe L. Toint · ACM Transactions on Mathematical Software · 1995 · 740 citations · Full text
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski et al. · ACM Transactions on Information and System Security · 2008 · 338 citations
Koushik Sen, Darko Marinov, Gul Agha · ACM SIGSOFT Software Engineering Notes · 2005 · 305 citations
1–5 of 70
174
4
h-index
3
h-index
Southern Illinois University Carbondale, United States
3 publications · 116 citations
3
h-index
3
h-index
3
h-index
1–5 of 174
93
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
10 publications
529 citations

Chinese Academy of Sciences
Beijing, China
6 h-index
16 publications
368 citations

National University of Defense Technology
Changsha, China
5 h-index
15 publications
256 citations
Institute of Software
Beijing, China
4 h-index
8 publications
384 citations
University of Arizona
Tucson, United States
4 h-index
8 publications
332 citations
UCLouvain
Louvain-la-Neuve, Belgium
4 h-index
7 publications
154 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
5 publications
338 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
4 publications
240 citations
1–8 of 93
2 publications · 232 citations
2
h-index
2 publications · 141 citations
2
h-index
SEN · 2 publications · 315 citations
2
h-index
STVR · 1 publications · 78 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5