sig
module type Param =
sig
type loop
val kf : Cil_types.kernel_function
val widening_delay : int
val widening_period : int
val slevel : Cil_types.stmt -> int
val merge : Cil_types.stmt -> bool
val unroll : State_partitioning.Param.loop -> int
end
module type Domain =
sig
type state
val top : state
val is_included : state -> state -> bool
val join : state -> state -> state
val widen :
Cil_types.kernel_function ->
Cil_types.stmt -> state -> state -> state
val narrow : state -> state -> state Eval.or_bottom
type t = state
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
module Set :
sig
type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val choose : t -> elt
val find : elt -> t -> elt
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val split : elt -> t -> t * bool * t
val nearest_elt_le : elt -> t -> elt
val nearest_elt_ge : elt -> t -> elt
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Map :
sig
type key = t
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
module Key :
sig
type t = key
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Make :
functor (Data : Datatype.S) ->
sig
type t = Data.t t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
end
module Hashtbl :
sig
type key = t
type 'a t
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val copy : 'a t -> 'a t
val add : 'a t -> key -> 'a -> unit
val remove : 'a t -> key -> unit
val find : 'a t -> key -> 'a
val find_all : 'a t -> key -> 'a list
val replace : 'a t -> key -> 'a -> unit
val mem : 'a t -> key -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_keys : 'a t -> key Seq.t
val to_seq_values : 'a t -> 'a Seq.t
val add_seq : 'a t -> (key * 'a) Seq.t -> unit
val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
val of_seq : (key * 'a) Seq.t -> 'a t
val iter_sorted :
?cmp:(key -> key -> int) -> (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted :
?cmp:(key -> key -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted_by_entry :
cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_entry :
cmp:(key * 'a -> key * 'a -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted_by_value :
cmp:('a -> 'a -> int) -> (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted_by_value :
cmp:('a -> 'a -> int) ->
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val find_opt : 'a t -> key -> 'a option
val find_def : 'a t -> key -> 'a -> 'a
val memo : 'a t -> key -> (key -> 'a) -> 'a
val structural_descr : Structural_descr.t -> Structural_descr.t
val make_type : 'a Type.t -> 'a t Type.t
module Key :
sig
type t = key
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
module Make :
functor (Data : Datatype.S) ->
sig
type t = Data.t t
val ty : t Type.t
val name : string
val descr : t Descr.t
val packed_descr : Structural_descr.pack
val reprs : t list
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int
val pretty_code : Format.formatter -> t -> unit
val internal_pretty_code :
Type.precedence -> Format.formatter -> t -> unit
val pretty : Format.formatter -> t -> unit
val varname : t -> string
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
val copy : t -> t
end
end
val mem : 'a Abstract_domain.key -> bool
val get : 'a Abstract_domain.key -> (state -> 'a) option
val set : 'a Abstract_domain.key -> 'a -> state -> state
val join_list :
?into:t Bottom.Type.or_bottom -> t list -> t Bottom.Type.or_bottom
end
module type Partition =
sig
type loop
type state
type store
type propagation
type shadow
type widening
val empty_store :
stmt:Cil_types.stmt option -> State_partitioning.Partition.store
val empty_propagation :
unit -> State_partitioning.Partition.propagation
val empty_shadow : unit -> State_partitioning.Partition.shadow
val empty_widening :
stmt:Cil_types.stmt option -> State_partitioning.Partition.widening
val initial_propagation :
State_partitioning.Partition.state list ->
State_partitioning.Partition.propagation
val pretty_store :
Stdlib.Format.formatter -> State_partitioning.Partition.store -> unit
val pretty_propagation :
Stdlib.Format.formatter ->
State_partitioning.Partition.propagation -> unit
val expanded :
State_partitioning.Partition.store ->
State_partitioning.Partition.state list
val smashed :
State_partitioning.Partition.store ->
State_partitioning.Partition.state Bottom.Type.or_bottom
val is_empty_store : State_partitioning.Partition.store -> bool
val is_empty_propagation :
State_partitioning.Partition.propagation -> bool
val is_empty_shadow : State_partitioning.Partition.shadow -> bool
val store_size : State_partitioning.Partition.store -> int
val propagation_size : State_partitioning.Partition.propagation -> int
val reset_store : State_partitioning.Partition.store -> unit
val reset_propagation :
State_partitioning.Partition.propagation -> unit
val reset_shadow : State_partitioning.Partition.shadow -> unit
val reset_widening : State_partitioning.Partition.widening -> unit
val enter_loop :
State_partitioning.Partition.propagation ->
State_partitioning.Partition.loop -> unit
val leave_loop :
State_partitioning.Partition.propagation ->
State_partitioning.Partition.loop -> unit
val next_loop_iteration :
State_partitioning.Partition.propagation ->
State_partitioning.Partition.loop -> unit
val clear_propagation :
State_partitioning.Partition.propagation -> unit
val transfer :
(State_partitioning.Partition.state list ->
State_partitioning.Partition.state list) ->
State_partitioning.Partition.propagation -> unit
val merge :
into:State_partitioning.Partition.propagation ->
State_partitioning.Partition.propagation -> unit
val join :
(State_partitioning.Partition.propagation *
State_partitioning.Partition.shadow)
list ->
State_partitioning.Partition.store ->
State_partitioning.Partition.propagation
val widen :
State_partitioning.Partition.store ->
State_partitioning.Partition.widening ->
State_partitioning.Partition.propagation -> bool
end
module type Partitioning =
functor (Domain : Domain) (Param : Param) ->
sig
type loop = Param.loop
type state = Domain.t
type store
type propagation
type shadow
type widening
val empty_store : stmt:Cil_types.stmt option -> store
val empty_propagation : unit -> propagation
val empty_shadow : unit -> shadow
val empty_widening : stmt:Cil_types.stmt option -> widening
val initial_propagation : state list -> propagation
val pretty_store : Format.formatter -> store -> unit
val pretty_propagation : Format.formatter -> propagation -> unit
val expanded : store -> state list
val smashed : store -> state Bottom.Type.or_bottom
val is_empty_store : store -> bool
val is_empty_propagation : propagation -> bool
val is_empty_shadow : shadow -> bool
val store_size : store -> int
val propagation_size : propagation -> int
val reset_store : store -> unit
val reset_propagation : propagation -> unit
val reset_shadow : shadow -> unit
val reset_widening : widening -> unit
val enter_loop : propagation -> loop -> unit
val leave_loop : propagation -> loop -> unit
val next_loop_iteration : propagation -> loop -> unit
val clear_propagation : propagation -> unit
val transfer : (state list -> state list) -> propagation -> unit
val merge : into:propagation -> propagation -> unit
val join : (propagation * shadow) list -> store -> propagation
val widen : store -> widening -> propagation -> bool
end
end