Package com.ibm.wala.dataflow.graph

This package provides a Killdall-style dataflow layer for a system of equations induced over a graph.

See:
Description

Interface Summary

IKilldallFramework<T,V extends IVariable>	A dataflow framework in the style of Kildall, POPL 73 This represents a dataflow problem induced over a graph.
ITransferFunctionProvider<T,V extends IVariable>	The DataflowSolver builds system over graphs, with dataflow transfer functions on the nodes, the edges or both.

Class Summary

AbstractMeetOperator<T extends IVariable>	Abstract superclass for meet operators
BasicFramework<T,V extends IVariable>	a basic implementation of the dataflow framework
BitVectorFilter	Operator OUT = IN - filterSet
BitVectorFramework<T,L>	a basic implementation of the dataflow framework
BitVectorIdentity	Operator OUT = IN
BitVectorKillAll	Just kills everything
BitVectorKillGen	Operator OUT = (IN - kill) U gen
BitVectorMinusVector	Operator OUT = IN / v
BitVectorOr	Operator OUT = IN U v
BitVectorSolver<T>	A DataflowSolver specialized for BitVectorVariables
BitVectorUnion	Operator U(n) = U(n) U U(j)
BitVectorUnionConstant	Operator OUT = IN U c
BitVectorUnionVector	Operator lhs = lhs U rhs U v
BooleanIdentity	Operator OUT = IN
BooleanSolver<T>	A DataflowSolver specialized for BooleanVariables
BooleanUnion	Operator U(n) = U(n) U U(j)
DataflowSolver<T,V extends IVariable<?>>	Iterative solver for a Killdall dataflow framework
UnaryBitVectorUnion	Operator U(n) = U(n) U U(j)

Package com.ibm.wala.dataflow.graph Description

This package provides a Killdall-style dataflow layer for a system of equations induced over a graph.