| | 15 | ** Intra-Procedural Points-To Analysis |
| | 16 | * Reference : Ben Hardekopf & Calvin Lin "The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code" |
| | 17 | * `PointsToGraph` : A points-to graph represents an over-approximation of "what pointers are point to" information in a function. |
| | 18 | * In the graph, nodes are the objects that are reachable from the function associated with the points-to graph. |
| | 19 | * The graph also maintains a set of objects, which is the "points-to set" of a node, for every node. |
| | 20 | * In the graph, edges are the subset-of relations between different nodes. |
| | 21 | * A client of `PointsToGraph` can |
| | 22 | 1. ask answers for the question "what a variable points to ?" |
| | 23 | 2. add additional points-to information to the graph. Modification to a graph will cause a re-computation of the graph. |