Jump to content

Call graph

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Jhrhee (talk | contribs) at 05:39, 25 January 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A call graph is a representation showing calling relationship among functions in a program. It shows the control flow of a program and it can be determined partially using a static analysis. However usually it is regarded as an nondeterministic structure since many branches are decided at run time. This term is frequently used in compiler and binary translation community. By tracking a call graph, it may be possible to detect anomaly of program execution or code injection attack.