Package com.ibm.wala.dataflow.graph
package com.ibm.wala.dataflow.graph
This package provides a Killdall-style dataflow layer for a system of equations induced over a
graph.
-
ClassDescriptionAbstractMeetOperator<T extends IVariable<T>>Abstract superclass for meet operatorsBasicFramework<T, V extends IVariable<V>>a basic implementation of the dataflow frameworkOperator OUT = IN - filterSetBitVectorFramework<T,
L> a basic implementation of the dataflow frameworkOperator OUT = INOperator U(n) = U(n) n U(j)Just kills everythingOperator OUT = (IN - kill) U genOperator OUT = IN / vOperator OUT = IN U vADataflowSolverspecialized forBitVectorVariablesOperator U(n) = U(n) U U(j)Operator OUT = IN U cOperator lhs = lhs U rhs U vOperator OUT = INADataflowSolverspecialized forBooleanVariablesOperator U(n) = U(n) U U(j)DataflowSolver<T, V extends IVariable<V>>Iterative solver for a Killdall dataflow frameworkIKilldallFramework<T, V extends IVariable<V>>A dataflow framework in the style of Kildall, POPL 73 This represents a dataflow problem induced over a graph.ITransferFunctionProvider<T, V extends IVariable<V>>TheDataflowSolverbuilds system over graphs, with dataflow transfer functions on the nodes, the edges or both.Operator U(n) = U(n) U U(j)