Class BoundedTabulationSolver<T,P,F>

java.lang.Object
com.ibm.wala.dataflow.IFDS.TabulationSolver<T,P,F>
com.ibm.wala.dataflow.IFDS.BoundedTabulationSolver<T,P,F>
Type Parameters:
T - type of node in the supergraph
P - type of a procedure (like a box in an RSM)
F - type of factoids propagated when solving this problem

public class BoundedTabulationSolver<T,P,F> extends TabulationSolver<T,P,F>
A TabulationSolver that gives up after a finite bound.
  • Constructor Details

  • Method Details

    • createBoundedTabulationSolver

      public static <T, P, F> BoundedTabulationSolver<T,P,F> createBoundedTabulationSolver(TabulationProblem<T,P,F> p, int bound, MonitorUtil.IProgressMonitor monitor)
    • propagate

      protected boolean propagate(T s_p, int i, T n, int j)
      Description copied from class: TabulationSolver
      Propagate the fact <s_p,i> -> <n, j> has arisen as a path edge. Returns <code>true</code> iff the path edge was not previously observed.
      Overrides:
      propagate in class TabulationSolver<T,P,F>
      Parameters:
      s_p - entry block
      i - dataflow fact on entry
      n - reached block
      j - dataflow fact reached
    • getNumSteps

      public int getNumSteps()
    • resetBound

      public void resetBound()