Constraint Generation
Constraint Generation is a methodological process in symbolic execution that systematically derives path constraints from program execution paths by collecting conditional expressions encountered during exploration, distinguishing it from other program analysis techniques through its focus on generating logical formulas representing feasible execution paths.
444
Publications
29.8K
Citations
1.2K
Authors
400
Institutions
Publications per year
2017–2026
184
Parents
444
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
1–5 of 444
1.2K
Illinois Institute of Technology, United States
12 publications · 1.5K citations
12
h-index
10
h-index
8
h-index
8
h-index
8
h-index
1–5 of 1.2K
400
Tsinghua University
Beijing, China
23 h-index
67 publications
5.6K citations

North China Electric Power University
Beijing, China
19 h-index
49 publications
1.9K citations
University of California, Berkeley
Berkeley, United States
17 h-index
31 publications
2.4K citations
University of Washington
Seattle, United States
13 h-index
18 publications
1.5K citations

Illinois Institute of Technology
Chicago, United States
13 h-index
16 publications
1.7K citations
Nanyang Technological University
Singapore, Singapore
13 h-index
22 publications
1.1K citations
Stanford University
Stanford, United States
12 h-index
26 publications
7.1K citations
Argonne National Laboratory
Lemont, United States
11 h-index
14 publications
2K citations
1–8 of 400
46 publications · 4.5K citations
37
h-index
TSTE · 23 publications · 2.4K citations
23
h-index
23 publications · 2.5K citations
22
h-index
6 publications · 188 citations
6
h-index
Conference · 6 publications · 131 citations
6
h-index
1–5