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