sig
type 'a value = private {
value : 'a;
hypothesis : Properties_status.Consolidation_tree.forest;
dependencies : State.t Properties_status.Consolidation_tree.value list;
}
and t = private {
property : Property.t;
state : State.t;
mutable status :
(Cil_types.annotation_status * State.t)
Properties_status.Consolidation_tree.value list;
}
and forest = Properties_status.Consolidation_tree.t list
val get_all : unit -> Properties_status.Consolidation_tree.forest
val get : Property.t -> Properties_status.Consolidation_tree.t
type vertex =
Property of Properties_status.Consolidation_tree.t
| State of State.t Properties_status.Consolidation_tree.value
| Status of
(Cil_types.annotation_status * State.t)
Properties_status.Consolidation_tree.value
val state_of_vertex :
Properties_status.Consolidation_tree.vertex -> State.t
type edge = And | Or
module G :
sig
type t
module V :
sig
type t = vertex
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
type label
val create : label -> t
val label : t -> label
end
type vertex = V.t
module E :
sig
type t = vertex * edge * vertex
val compare : t -> t -> int
type vertex = vertex
val src : t -> vertex
val dst : t -> vertex
type label = edge
val create : vertex -> label -> vertex -> t
val label : t -> label
end
type edge = E.t
val is_directed : bool
val is_empty : t -> bool
val nb_vertex : t -> int
val nb_edges : t -> int
val out_degree : t -> vertex -> int
val in_degree : t -> vertex -> int
val mem_vertex : t -> vertex -> bool
val mem_edge : t -> vertex -> vertex -> bool
val mem_edge_e : t -> edge -> bool
val find_edge : t -> vertex -> vertex -> edge
val succ : t -> vertex -> vertex list
val pred : t -> vertex -> vertex list
val succ_e : t -> vertex -> edge list
val pred_e : t -> vertex -> edge list
val iter_vertex : (vertex -> unit) -> t -> unit
val fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges : (vertex -> vertex -> unit) -> t -> unit
val fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (edge -> unit) -> t -> unit
val fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
val map_vertex : (vertex -> vertex) -> t -> t
val iter_succ : (vertex -> unit) -> t -> vertex -> unit
val iter_pred : (vertex -> unit) -> t -> vertex -> unit
val fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_succ_e : (edge -> unit) -> t -> vertex -> unit
val fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
val iter_pred_e : (edge -> unit) -> t -> vertex -> unit
val fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
end
val get_full_graph : unit -> Properties_status.Consolidation_tree.G.t
val get_graph : Property.t -> Properties_status.Consolidation_tree.G.t
val dump : Properties_status.Consolidation_tree.G.t -> string -> unit
end