finite
This class represents a depth-first ordering of a graph, as it appears in the Aho, Sehti, Ullman book on compilers.
This is the abstract class for an equation system with a finite set of unknowns AND static dependencies between them.
This is the abstract class for an equation system with a finite set of unknowns AND static dependencies between
them. When computing apply(rho)(x), the result may only depend on values of rho(y) for an y such that
y infl x.
This is the abstract class for a finite equation system generated by an hyper-graph.
This is the abstract class for a finite equation system generated by an hyper-graph. Unknowns are nodes of the graph and each hyper-edge has a single target and many possible sources. Given an assignment, each hyper-edge produces a partial values. These values are combined with the upper bound operation.
A GraphOrdering is an ordering on objects of the type N (which should be thought of
as nodes of a graph), where for each object we mark whether it is an head element or not.
A GraphOrdering is an ordering on objects of the type N (which should be thought of
as nodes of a graph), where for each object we mark whether it is an head element or not.
Note that a graph ordering generally considers only a subset of the elements of type N,
those returned by the toSeq method. The result of applying any method of this trait
on any element which is not part of the domain is not specified.
the type of the ordered element.
Hierarchical ordering as defined in Bourdoncle's paper "Efficient chaotic iteration strategies with widenings", FMPA'93.
The companion class for a DFOrdering defines the required enumerations and factory methods.
This solver is a commodity interface for the other finite fixpoint solvers.
This solver is a commodity interface for the other finite fixpoint solvers. It takes some parameters as inputs and plans a sequence of actions in order to obtain the desired solutions as the output.
The companion class for a hierarchical ordering contains the definition of the Element class and some
factory methods.
A solver whose strategy in based on a hierarchical ordering.
A solver based on Kleene iteration.
A fixpoint solver based on priority worklists.
A fixpoint solver based on the round robin strategy.
A fixpoint solver based on a worklist.
This class represents a depth-first ordering of a graph, as it appears in the Aho, Sehti, Ullman book on compilers. It extends the concept of graph ordering distinguishing between Advancing, Retreating and Cross edges.
the type of the nodes of the graph