Control-flow Graph Construction
Control-Flow Graph Construction is a method in program analysis that formalizes the syntactic and semantic structure of a program by representing its executable paths as a directed graph where nodes denote basic blocks and edges capture the possible control transitions between them.
320
Publications
15.9K
Citations
749
Authors
282
Institutions
Publications per year
2017–2026
54
Parents
320
Formal semantics and analysis of control flow in WS-BPEL
Chun Ouyang, Eric Verbeek, Wil M. P. van der Aalst et al. · Science of Computer Programming · 2007 · 341 citations · Full text
Program analysis via graph reachability
Thomas Reps · Information and Software Technology · 1998 · 330 citations
1–5 of 320
749
6
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 749
282
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
20 publications
842 citations
IBM (United States)
Armonk, United States
8 h-index
11 publications
938 citations
University of California, Berkeley
Berkeley, United States
7 h-index
13 publications
1.7K citations
University of Wisconsin–Madison
Madison, United States
6 h-index
10 publications
812 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
6 h-index
8 publications
1.1K citations
Nanyang Technological University
Singapore, Singapore
6 h-index
12 publications
542 citations
The Ohio State University
Columbus, United States
5 h-index
6 publications
314 citations

University of Waterloo
Waterloo, Canada
5 h-index
6 publications
238 citations
1–8 of 282
13 publications · 430 citations
12
h-index
8 publications · 365 citations
8
h-index
7 publications · 533 citations
7
h-index
TSE · 6 publications · 529 citations
6
h-index
Repository · 5 publications · 97 citations
5
h-index
1–5