DataFlowAnalysis

abstract val lattice: L

abstract def run(): Unit

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def backwardAnalysis(f: (P, Elem) ⇒ Elem): Unit

.

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def forwardAnalysis(f: (P, Elem) ⇒ Elem): Unit

Implements forward dataflow analysis: the transfer function is applied when inputs to a Program point change, to obtain the new output value.

final def getClass(): Class[_]

def hashCode(): Int

val in: Map[P, Elem]

def init(f: ⇒ Unit): Unit

final def isInstanceOf[T0]: Boolean

var iterations: Int

the number of times we iterated before reaching a fixpoint.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val out: Map[P, Elem]

def reinit(f: ⇒ Unit): Unit

Reinitialize, but keep the old solutions.

var stat: Boolean

collect statistics?

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

val visited: HashSet[P]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

val worklist: Set[P]