module Make:
This functor provides the partitioning algorithm constructing a WTO.
Parameters: |
|
typepref =
Node.t -> Node.t -> int
partial order of preference for the choice of the head of a loop
val partition : ?pref:pref ->
init:Node.t -> succs:(Node.t -> Node.t list) -> Node.t Wto.partition
Implements Bourdoncle "Efficient chaotic iteration strategies with widenings" algorithm to compute a WTO.
val pretty_partition : Format.formatter -> Node.t Wto.partition -> unit
val pretty_component : Format.formatter -> Node.t Wto.component -> unit
val equal_component : Node.t Wto.component -> Node.t Wto.component -> bool
val equal_partition : Node.t Wto.partition -> Node.t Wto.partition -> bool