정의: A call graph is a control-flow graph, which represents calling relationships between subroutines in a computer program. Each node represents a procedure and each edge (f, g) indicates that procedure f calls procedure g. Thus, a cycle in the graph indicates recursive procedure calls.
| 핵심 연구 분야 | Verification |
|---|---|
| 주요 연도 | N/A년 |
| 주요 연관 키워드 | engineers |
| 좋아요 수 | 0 |