End Kildall.
End Backward_Dataflow_Solver.
(** * Analysis on extended basic blocks *)
(** We now define an approximate solver for forward dataflow problems that proceeds by forward propagation over extended basic blocks. In other terms, program points with multiple predecessors are mapped to [L.top] (the greatest, or coarsest, approximation) and the other program points are mapped to [transf p X[p]] where [p] is their unique predecessor.  This analysis applies to any type of approximations equipped with an ordering and a greatest element. *)
Module Type ORDERED_TYPE_WITH_TOP.
Parameter t: Type.
Parameter ge: t -> t -> Prop.
Parameter top: t.

(* Specifications: *)
Axiom top_ge: forall x, ge top x.
Axiom refl_ge: forall x, ge x x.
End ORDERED_TYPE_WITH_TOP.