Frama-C API - WTO
Datatype for WTOs
type node = vertex
Partial order of preference for the choice of the head of a loop. pref current_head new_candidate
must return < 0 if new_candidate
is preferred to current_head
. Use "(fun _ _ -> 0)" for no specific preference.
Implements Bourdoncle "Efficient chaotic iteration strategies with widenings" algorithm to compute a WTO.
val pretty_partition : Stdlib.Format.formatter -> node Wto.partition -> unit
val pretty_component : Stdlib.Format.formatter -> node Wto.component -> unit
val equal_component : node Wto.component -> node Wto.component -> bool
val equal_partition : node Wto.partition -> node Wto.partition -> bool