| CGAnalysis |
|
| ClassHierarchyAnalysis |
This analysis builds a call graph using Class Hierarchy Analysis (CHA).
|
| ClassicHybridTypeAnalysis |
Performs a Hybrid Type Analysis (XTA), which is a modification
to RTA that combines XTA and MTA as discussed in the paper:
Scalable Propagation-Based Call Graph Construction Algorithms
by Frank Tip and Jens Palsberg.
|
| ExceptionTypeAnalysis |
Performs an Exception Type Analysis (ETA), which is a modification
to RTA that considers inter-procedural exceptional flows.
|
| FieldTypeAnalysis |
Performs a Field Type Analysis (FTA), which is a modification
to RTA discussed in the paper:
Scalable Propagation-Based Call Graph Construction Algorithms
by Frank Tip and Jens Palsberg.
|
| HybridTypeAnalysis |
Performs a Hybrid Type Analysis (XTA), which is a modification
to RTA that combines XTA and MTA as discussed in the paper:
Scalable Propagation-Based Call Graph Construction Algorithms
by Frank Tip and Jens Palsberg.
|
| MethodTypeAnalysis |
Performs a Method Type Analysis (MTA), which is a modification
to RTA discussed in the paper:
Scalable Propagation-Based Call Graph Construction Algorithms
by Frank Tip and Jens Palsberg.
|
| RapidTypeAnalysis |
Performs a Rapid Type Analysis (RTA)
In terms of call graph construction precision this algorithm
ranks better than CHA.
|
| ReachabilityAnalysis |
This is about the simplest call graph we can make (dumber than a CHA).
|
| ZeroControlFlowAnalysis |
Performs a 0-CFA Andersen style points-to analysis
to resolve runtime types and infer dynamic dispatches
on the fly.
|