
| Interface | Description | 
|---|---|
| Analysis<N,E,G extends Graph<N,E,?>,A extends Assumption<A>> | 
 A simple, non-transforming flow analysis. 
 | 
| Assumption<Self extends Assumption<?>> | 
 Assumptions are members of the lattice used in the analysis. 
 | 
| AssumptionMap<E,A extends Assumption<A>> | |
| FlowFunction<N,E,G extends Graph<N,E,?>,A extends Assumption<A>> | 
 A flow function receives node assumptions and transforms them according to
 node semantics. 
 | 
| Graph<NodeType,EdgeType,TransformerType> | 
 Directed graph abstraction for flow analysis. 
 | 
| IntegratedAnalysis<N,E,T,G extends Graph<N,E,T>,A extends Assumption<A>> | 
 Integrated analysis combines analysis with transformation as described in
 Lerner et al. 
 | 
| IntegratedFlowFunction<N,E,T,G extends Graph<N,E,T>,A extends Assumption<A>> | 
 Integrated flow function should either interpret the node, or produce
 node transformation based on already computed assumptions. 
 | 
| TransformationFunction<N,E,T,G extends Graph<N,E,T>,A extends Assumption<A>> | 
 Transformation function defines an optional transformation of a graph node
 based on node assumptions. 
 | 
| TransformationFunction.Transformation<T,G extends Graph<?,?,T>> | 
 Transformation defines new subgraph replacement for a node, and
 transformation which will be applied during the last (actualizing) step
 of analysis. 
 | 
| Class | Description | 
|---|---|
| AnalysisSolver<N,E,T,G extends Graph<N,E,T>,A extends Assumption<A>> | 
 A solver to solve all kinds of analyses defined in the package. 
 | 
| AssumptionUtil | 
 Utilities for working with assumption values. 
 | 
| CombinedIntegratedAnalysis<N,E,T,G extends Graph<N,E,T>> | 
 Integrated analysis, which combines several other integrated analyses into
 one. 
 | 
| CombinedIntegratedAnalysis.CombinedAssumption | 
 Combined assumption which holds vector of original assumptions. 
 | 
| DataflowOptimizer | |
| SubgraphAssumptions<A extends Assumption<?>> | 
 Set of all assumptions for all edges coming from/to a subgraph. 
 | 
Copyright © 2018. All rights reserved.