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

Authors

749

  1. MJ
    Mary Jean Harrold

    Georgia Institute of Technology, United States

    5 publications · 344 citations

    6

    h-index

  2. CC
    Craig Chambers

    University of Washington, United States

    5 publications · 730 citations

    5

    h-index

  3. JR
    James R. Larus

    University of Wisconsin–Madison, United States

    4 publications · 175 citations

    4

    h-index

  4. AC
    Alessandro Cimatti

    Fondazione Bruno Kessler, Italy

    4 publications · 307 citations

    4

    h-index

  5. YL
    Yang Liu

    Nanyang Technological University, Singapore

    4 publications · 311 citations

    4

    h-index

1–5 of 749

Venues

  1. ACM SIGPLAN Notices

    13 publications · 430 citations

    12

    h-index

  2. IEEE Transactions on Computers

    8 publications · 365 citations

    8

    h-index

  3. 7

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 6 publications · 529 citations

    6

    h-index

  5. arXiv (Cornell University)

    Repository · 5 publications · 97 citations

    5

    h-index

1–5