| 27 | | * `InvocationGraphNode` |
| | 27 | * `InvocationGraphNode`: a node represents a lexical function call in the program. An invocation graph consists of nodes for all lexical function calls in a program. |
| | 28 | * A node `n` has multiple children, each of which represents a lexical function call in the function body of the function associated with `n`. |
| | 29 | * A node `n` also has parent node which represents a lexical call to a function whose body contains the call represented by `n`. |
| | 30 | * A node `n` has no child if there is no lexical call in the function body associated with it or it represents a recursive call (i.e., an ancestor of `n` is associated with the same function as `n`). |
| | 31 | * Every `InvocationGraphNode` is associated with a unique instance of a `PointsToGraph` |
| | 32 | * The inter-procedural analysis traverses the invocation graph and keeps updating the `PointsToGraph` of each node until a fix-point is reached |
