class |
ClassHierarchyAnalysis |
This analysis builds a call graph using Class Hierarchy Analysis (CHA).
|
class |
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.
|
class |
ExceptionTypeAnalysis |
Performs an Exception Type Analysis (ETA), which is a modification
to RTA that considers inter-procedural exceptional flows.
|
class |
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.
|
class |
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.
|
class |
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.
|
class |
RapidTypeAnalysis |
Performs a Rapid Type Analysis (RTA)
In terms of call graph construction precision this algorithm
ranks better than CHA.
|
class |
ReachabilityAnalysis |
This is about the simplest call graph we can make (dumber than a CHA).
|
class |
ZeroControlFlowAnalysis |
Performs a 0-CFA Andersen style points-to analysis
to resolve runtime types and infer dynamic dispatches
on the fly.
|