| Interface | Description |
|---|---|
| JoinHandlingNode<T> | |
| LinkedNode<D> | Deprecated
Use
JoinHandlingNode instead. |
| Class | Description |
|---|---|
| BiDiIDESolver<N,D,M,V,I extends InterproceduralCFG<N,M>> |
This is a special IFDS solver that solves the analysis problem inside out, i.e., from further down the call stack to
further up the call stack.
|
| BiDiIFDSSolver<N,D extends JoinHandlingNode<D>,M,I extends InterproceduralCFG<N,M>> |
This is a special IFDS solver that solves the analysis problem inside out, i.e., from further down the call stack to
further up the call stack.
|
| CountingThreadPoolExecutor |
A
ThreadPoolExecutor which keeps track of the number of spawned
tasks to allow clients to await their completion. |
| CountLatch |
A synchronization aid similar to
CountDownLatch but with the ability
to also count up. |
| FlowFunctionDotExport<N,D,M,I extends InterproceduralCFG<N,M>> |
A class to dump the results of flow functions to a dot file for visualization.
|
| IDESolver<N,D,M,V,I extends InterproceduralCFG<N,M>> |
Solves the given
IDETabulationProblem as described in the 1996 paper by Sagiv,
Horwitz and Reps. |
| IFDSSolver<N,D,M,I extends InterproceduralCFG<N,M>> |
A solver for an
IFDSTabulationProblem. |
| JoinHandlingNode.JoinKey | |
| JoinHandlingNodesIFDSSolver<N,D extends JoinHandlingNode<D>,M,I extends InterproceduralCFG<N,M>> |
An
IFDSSolver that tracks paths for reporting. |
| JumpFunctions<N,D,L> |
The IDE algorithm uses a list of jump functions.
|
| Pair<T,U> | |
| PathEdge<N,D> |
A path edge as described in the IFDS/IDE algorithms.
|
| PathTrackingIFDSSolver<N,D extends LinkedNode<D>,M,I extends InterproceduralCFG<N,M>> | Deprecated
Use
JoinHandlingNodesIFDSSolver instead. |
| Enum | Description |
|---|---|
| IFDSSolver.BinaryDomain |