| Activator |
The activator class controls the plug-in life cycle
|
| Activator |
The activator class controls the plug-in life cycle
|
| AcyclicCFGSmartView |
The Smartview accept a function/method node and spits out the acyclic CFG transform based
on the algorithm implemented in DAGTransform. |
| BottomUpBFMultiplicitiesPathCounter |
This program counts all paths in a CFG by counting path multiplicities.
|
| BottomUpDFMultiplicitiesPathCounter |
This program counts all paths in a CFG by counting path multiplicities.
|
| DAGTransform |
|
| Log |
Centralized logging for Eclipse plugins.
|
| Log |
Centralized logging for Eclipse plugins.
|
| PathCounter |
A base class to define the common interface and configurations of program path counting algorithms
|
| PathCounter.CountingResult |
Holds a path counting result, which consists of the number of paths counted
and the number of additions performed to compute the result.
|
| PathCounterPreferences |
Path Counter Preferences
|
| PathCounterPreferencesPage |
|
| PathDetailView |
|
| PathEnumerator |
|
| PathEnumerator.EnumerationResult |
Holds a path counting result and the path enumeration
|
| PathExpressions |
|
| PathFactory |
This is an Atlas implementation of a path counting algorithm for graphs without enumeration.
|
| PathSequence |
|
| PathSequenceSmartView |
The Smartview accept a function/method node and spits out the acyclic CFG transform based
on the algorithm implemented in DAGTransform. |
| ProgramGraphTransform |
|
| SaveApplicationPathCountSummaryHandler |
A menu handler for saving the application path count summary
|
| TopDownBFMultiplicitiesPathCounter |
This program counts all paths in a CFG by counting path multiplicities.
|
| TopDownBFPropagatePathEnumerator |
This program counts all paths in the graph by iteratively enumerating all
paths.
|
| TopDownBFPropagatePathExpressions |
|
| TopDownDFBacktrackPathEnumerator |
This program counts all paths in the graph by iteratively enumerating all
paths.
|
| TopDownDFMultiplicitiesPathCounter |
This program counts all paths in a CFG by counting path multiplicities.
|