Call Graph
A call graph is a fundamental data structure in program analysis that models the calling relationships among functions in a program as a directed graph, used in scenarios such as static analysis and reachability determination.
Timeline (last 90 days)
At runtime, REVA injects three types of precomputed information into the LLM: a precomputed threat model for the module in question, lightweight static analysis findings, and call graph information.
Precisely building call graphs statically is nearly impossible in real-world engineering, because dynamic dispatch in object-oriented languages requires type inference, and mechanisms such as reflection, dependency injection and callback registration make call targets unknowable at compile time.
In engineering practice, a hybrid approach combining static analysis and runtime instrumentation is typically used to build call graphs, and a certain number of false negatives and false positives is accepted.
All Facts (3)
At runtime, REVA injects three types of precomputed information into the LLM: a precomputed threat model for the module in question, lightweight static analysis findings, and call graph information.
50%UnverifiedPrecisely building call graphs statically is nearly impossible in real-world engineering, because dynamic dispatch in object-oriented languages requires type inference, and mechanisms such as reflection, dependency injection and callback registration make call targets unknowable at compile time.
50%UnverifiedIn engineering practice, a hybrid approach combining static analysis and runtime instrumentation is typically used to build call graphs, and a certain number of false negatives and false positives is accepted.
50%