GraphEquationSystem

Abstract Value Members

abstract val body: Body[U, V]

The body of the equation system, i.e., a map Assignment[U,V] => Assignment[U,V].
The body of the equation system, i.e., a map Assignment[U,V] => Assignment[U,V].

Definition Classes
EquationSystem
abstract val bodyWithDependencies: BodyWithDependencies[U, V]

Given an assignment rho and unknown u, returns the pair (body(rho)(x), uks).
Given an assignment rho and unknown u, returns the pair (body(rho)(x), uks). uks is a set of unknowns with the property that if rho' differs from rho only for variables which are not in uks, then body(rho)(u)==body(rho')(u).

Definition Classes
EquationSystem
abstract val dom: Domain[V]

The domain type-class for the type V.
abstract val edgeAction: EdgeAction[U, V, E]

A function which, given an assignment and an edge, returns the output value of the edge.
abstract val infl: Relation[U]

The static relation between an unknown x and the unknowns y it influences.
The static relation between an unknown x and the unknowns y it influences. If infl(x) does not contain y, it means that eqs(rho)(y) == eqs(rho')(y), when rho' = rho[x / eqs(rho)(x)].

Definition Classes
FiniteEquationSystem
abstract val ingoing: (U) ⇒ Iterable[E]

Maps each unknown to the collection of edges arriving on it.
abstract val initial: InputAssignment[U, V]

An initial value for starting the analyzer
An initial value for starting the analyzer

Definition Classes
EquationSystem
abstract val inputUnknowns: Set[U]

The unknowns which may be considered the input to this equation system.
The unknowns which may be considered the input to this equation system.

Definition Classes
FiniteEquationSystem → EquationSystem
abstract val outgoing: (U) ⇒ Iterable[E]

Maps each unknown to the collection of edges departing from it.
abstract val sources: (E) ⇒ Iterable[U]

Maps each edge to its source unknowns.
abstract val target: (E) ⇒ U

Maps each edge to its target unknown.
abstract val unknowns: Iterable[U]

The collection of all unknowns.
The collection of all unknowns.

Definition Classes
FiniteEquationSystem
abstract def withBaseAssignment(init: PartialFunction[U, V])(implicit magma: Magma[V]): FiniteEquationSystem[U, V]

Combine a base assignment with the equation system.
Combine a base assignment with the equation system. The type V should be endowed with a magma.
init
the assignment to add to the equation system

Definition Classes
FiniteEquationSystem → EquationSystem
abstract def withBoxes(boxes: BoxAssignment[U, V]): FiniteEquationSystem[U, V]

Add boxes to the equation system
Add boxes to the equation system
boxes
a box assignment

Definition Classes
FiniteEquationSystem → EquationSystem
abstract def withLocalizedBoxes(boxes: BoxAssignment[U, V], ordering: Ordering[U]): GraphEquationSystem[U, V, E]

Add boxes to the equation system in a localized way.
Add boxes to the equation system in a localized way.
boxes
new boxes to add.
ordering
an order on unknown used to decide which edges needs to be widened
abstract def withLocalizedWarrowing(widenings: BoxAssignment[U, V], narrowings: BoxAssignment[U, V], ordering: Ordering[U]): FiniteEquationSystem[U, V]

Add warrowing to the equation system in a localized way.
Add warrowing to the equation system in a localized way. Localized warrowing requires a different procedure than standard localized widenings. Moreover, it is not entirely clear whether this works as intended or not.
widenings
a widening assignment
narrowings
a narrowing assignment
abstract def withTracer(t: EquationSystemTracer[U, V]): GraphEquationSystem[U, V, E]

Add a tracer to the equation system.
Add a tracer to the equation system. The tracer contains call-backs to be invoked during body evaluation.
t
the tracer

Definition Classes
GraphEquationSystem → FiniteEquationSystem → EquationSystem

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object GraphEquationSystem | package finite

trait GraphEquationSystem[U, V, E] extends FiniteEquationSystem[U, V]

Abstract Value Members

abstract val body: Body[U, V]

abstract val bodyWithDependencies: BodyWithDependencies[U, V]

abstract val dom: Domain[V]

abstract val edgeAction: EdgeAction[U, V, E]

abstract val infl: Relation[U]

abstract val ingoing: (U) ⇒ Iterable[E]

abstract val initial: InputAssignment[U, V]

abstract val inputUnknowns: Set[U]

abstract val outgoing: (U) ⇒ Iterable[E]

abstract val sources: (E) ⇒ Iterable[U]

abstract val target: (E) ⇒ U

abstract val unknowns: Iterable[U]

abstract def withBaseAssignment(init: PartialFunction[U, V])(implicit magma: Magma[V]): FiniteEquationSystem[U, V]

abstract def withBoxes(boxes: BoxAssignment[U, V]): FiniteEquationSystem[U, V]

abstract def withLocalizedBoxes(boxes: BoxAssignment[U, V], ordering: Ordering[U]): GraphEquationSystem[U, V, E]

abstract def withLocalizedWarrowing(widenings: BoxAssignment[U, V], narrowings: BoxAssignment[U, V], ordering: Ordering[U]): FiniteEquationSystem[U, V]

abstract def withTracer(t: EquationSystemTracer[U, V]): GraphEquationSystem[U, V, E]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from FiniteEquationSystem[U, V]

Inherited from EquationSystem[U, V]

Inherited from AnyRef

Inherited from Any

Ungrouped