sig
type 'v value =
Single of (module Abstract_value.Leaf with type t = 'v)
| Struct of 'v Abstract.Value.structure
type precise_loc = Precise_locs.precise_location
module type leaf_domain =
sig
type state
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 disjoint : t -> t -> bool
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
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 min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Seq.t
val to_seq : t -> elt Seq.t
val add_seq : elt Seq.t -> t -> t
val of_seq : elt Seq.t -> 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 update : key -> ('a option -> 'a option) -> '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 union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a 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 min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
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 find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Seq.t
val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Seq.t -> 'a 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 top : t
val is_included : t -> t -> bool
val join : t -> t -> t
val widen : Cil_types.kernel_function -> Cil_types.stmt -> t -> t -> t
val narrow : t -> t -> t Eval.or_bottom
type value
type location = precise_loc
type origin
val extract_expr :
(Cil_types.exp -> value Eval.evaluated) ->
t -> Cil_types.exp -> (value * origin option) Eval.evaluated
val extract_lval :
(Cil_types.exp -> value Eval.evaluated) ->
t ->
Cil_types.lval ->
Cil_types.typ -> location -> (value * origin option) Eval.evaluated
val backward_location :
t ->
Cil_types.lval ->
Cil_types.typ ->
location -> value -> (location * value) Eval.or_bottom
val reduce_further :
t -> Cil_types.exp -> value -> (Cil_types.exp * value) list
val update :
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val assign :
Cil_types.kinstr ->
location Eval.left_value ->
Cil_types.exp ->
(location, value) Eval.assigned ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val assume :
Cil_types.stmt ->
Cil_types.exp ->
bool ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val start_call :
Cil_types.stmt ->
(location, value) Eval.call ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val finalize_call :
Cil_types.stmt ->
(location, value) Eval.call -> pre:t -> post:t -> t Eval.or_bottom
val show_expr :
(value, location, origin) Abstract_domain.valuation ->
t -> Format.formatter -> Cil_types.exp -> unit
val logic_assign :
(Eval.logic_assign * state) option -> location -> state -> state
val evaluate_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> Alarmset.status
val reduce_by_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> bool -> state Eval.or_bottom
val enter_scope :
Abstract_domain.variable_kind -> Cil_types.varinfo list -> t -> t
val leave_scope :
Cil_types.kernel_function -> Cil_types.varinfo list -> t -> t
val empty : unit -> t
val initialize_variable :
Cil_types.lval ->
location -> initialized:bool -> Abstract_domain.init_value -> t -> t
val initialize_variable_using_type :
Abstract_domain.variable_kind -> Cil_types.varinfo -> t -> t
val enter_loop : Cil_types.stmt -> state -> state
val incr_loop_counter : Cil_types.stmt -> state -> state
val leave_loop : Cil_types.stmt -> state -> state
val relate :
Cil_types.kernel_function -> Base.Hptset.t -> t -> Base.SetLattice.t
val filter :
Cil_types.kernel_function ->
[ `Post | `Pre ] -> Base.Hptset.t -> t -> t
val reuse :
Cil_types.kernel_function ->
Base.Hptset.t -> current_input:t -> previous_output:t -> t
val log_category : Value_parameters.category
module Store :
sig
val register_global_state : state Eval.or_bottom -> unit
val register_initial_state : Value_types.callstack -> state -> unit
val register_state_before_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val register_state_after_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val get_global_state : unit -> state Eval.or_bottom
val get_initial_state :
Cil_types.kernel_function -> state Eval.or_bottom
val get_initial_state_by_callstack :
Cil_types.kernel_function ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
val get_stmt_state :
after:bool -> Cil_types.stmt -> state Eval.or_bottom
val get_stmt_state_by_callstack :
after:bool ->
Cil_types.stmt ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
end
val post_analysis : t Eval.or_bottom -> unit
val key : t Abstract_domain.key
end
module type domain_functor =
functor (Value : Abstract.Value.External) ->
sig
type state
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 disjoint : t -> t -> bool
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
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 min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Seq.t
val to_seq : t -> elt Seq.t
val add_seq : elt Seq.t -> t -> t
val of_seq : elt Seq.t -> 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 update : key -> ('a option -> 'a option) -> '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 union :
(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a 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 min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
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 find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Seq.t
val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Seq.t -> 'a 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 top : t
val is_included : t -> t -> bool
val join : t -> t -> t
val widen :
Cil_types.kernel_function -> Cil_types.stmt -> t -> t -> t
val narrow : t -> t -> t Eval.or_bottom
type value = Value.t
type location = precise_loc
type origin
val extract_expr :
(Cil_types.exp -> value Eval.evaluated) ->
t -> Cil_types.exp -> (value * origin option) Eval.evaluated
val extract_lval :
(Cil_types.exp -> value Eval.evaluated) ->
t ->
Cil_types.lval ->
Cil_types.typ -> location -> (value * origin option) Eval.evaluated
val backward_location :
t ->
Cil_types.lval ->
Cil_types.typ ->
location -> value -> (location * value) Eval.or_bottom
val reduce_further :
t -> Cil_types.exp -> value -> (Cil_types.exp * value) list
val update :
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val assign :
Cil_types.kinstr ->
location Eval.left_value ->
Cil_types.exp ->
(location, value) Eval.assigned ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val assume :
Cil_types.stmt ->
Cil_types.exp ->
bool ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val start_call :
Cil_types.stmt ->
(location, value) Eval.call ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val finalize_call :
Cil_types.stmt ->
(location, value) Eval.call -> pre:t -> post:t -> t Eval.or_bottom
val show_expr :
(value, location, origin) Abstract_domain.valuation ->
t -> Format.formatter -> Cil_types.exp -> unit
val logic_assign :
(Eval.logic_assign * state) option -> location -> state -> state
val evaluate_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> Alarmset.status
val reduce_by_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> bool -> state Eval.or_bottom
val enter_scope :
Abstract_domain.variable_kind -> Cil_types.varinfo list -> t -> t
val leave_scope :
Cil_types.kernel_function -> Cil_types.varinfo list -> t -> t
val empty : unit -> t
val initialize_variable :
Cil_types.lval ->
location ->
initialized:bool -> Abstract_domain.init_value -> t -> t
val initialize_variable_using_type :
Abstract_domain.variable_kind -> Cil_types.varinfo -> t -> t
val enter_loop : Cil_types.stmt -> state -> state
val incr_loop_counter : Cil_types.stmt -> state -> state
val leave_loop : Cil_types.stmt -> state -> state
val relate :
Cil_types.kernel_function ->
Base.Hptset.t -> t -> Base.SetLattice.t
val filter :
Cil_types.kernel_function ->
[ `Post | `Pre ] -> Base.Hptset.t -> t -> t
val reuse :
Cil_types.kernel_function ->
Base.Hptset.t -> current_input:t -> previous_output:t -> t
val log_category : Value_parameters.category
module Store :
sig
val register_global_state : state Eval.or_bottom -> unit
val register_initial_state :
Value_types.callstack -> state -> unit
val register_state_before_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val register_state_after_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val get_global_state : unit -> state Eval.or_bottom
val get_initial_state :
Cil_types.kernel_function -> state Eval.or_bottom
val get_initial_state_by_callstack :
Cil_types.kernel_function ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
val get_stmt_state :
after:bool -> Cil_types.stmt -> state Eval.or_bottom
val get_stmt_state_by_callstack :
after:bool ->
Cil_types.stmt ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
end
val post_analysis : t Eval.or_bottom -> unit
val key : t Abstract_domain.key
end
type 'v domain =
Domain :
(module Abstractions.leaf_domain with type value = 'v) -> 'v
Abstractions.domain
| Functor :
(module Abstractions.domain_functor) -> 'a Abstractions.domain
type 'v abstraction = {
values : 'v Abstractions.value;
domain : 'v Abstractions.domain;
}
type 't with_info = {
name : string;
experimental : bool;
priority : int;
abstraction : 't;
}
type flag =
Flag :
'v Abstractions.abstraction Abstractions.with_info -> Abstractions.flag
val register :
name:string ->
descr:string ->
?experimental:bool ->
?priority:int -> 'v Abstractions.abstraction -> Abstractions.flag
val dynamic_register :
name:string -> descr:string -> (unit -> Abstractions.flag) -> unit
type ('a, 'b) value_reduced_product =
'a Abstract.Value.key * 'b Abstract.Value.key * ('a -> 'b -> 'a * 'b)
val register_value_reduction :
('a, 'b) Abstractions.value_reduced_product -> unit
module type Value =
sig
type 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
val pretty_typ : Cil_types.typ option -> t Pretty_utils.formatter
val top : t
val is_included : t -> t -> bool
val join : t -> t -> t
val narrow : t -> t -> t Eval.or_bottom
val zero : t
val one : t
val top_int : t
val inject_int : Cil_types.typ -> Integer.t -> t
val assume_non_zero : t -> t Abstract_value.truth
val assume_bounded :
Abstract_value.bound_kind ->
Abstract_value.bound -> t -> t Abstract_value.truth
val assume_not_nan :
assume_finite:bool -> Cil_types.fkind -> t -> t Abstract_value.truth
val assume_pointer : t -> t Abstract_value.truth
val assume_comparable :
Abstract_value.pointer_comparison ->
t -> t -> (t * t) Abstract_value.truth
val constant : Cil_types.exp -> Cil_types.constant -> t
val forward_unop :
Cil_types.typ -> Cil_types.unop -> t -> t Eval.or_bottom
val forward_binop :
Cil_types.typ -> Cil_types.binop -> t -> t -> t Eval.or_bottom
val rewrap_integer : Eval_typ.integer_range -> t -> t
val forward_cast :
src_type:Eval_typ.scalar_typ ->
dst_type:Eval_typ.scalar_typ -> t -> t Eval.or_bottom
val backward_binop :
input_type:Cil_types.typ ->
resulting_type:Cil_types.typ ->
Cil_types.binop ->
left:t -> right:t -> result:t -> (t option * t option) Eval.or_bottom
val backward_unop :
typ_arg:Cil_types.typ ->
Cil_types.unop -> arg:t -> res:t -> t option Eval.or_bottom
val backward_cast :
src_typ:Cil_types.typ ->
dst_typ:Cil_types.typ ->
src_val:t -> dst_val:t -> t option Eval.or_bottom
val resolve_functions : t -> Kernel_function.t list Eval.or_top * bool
val structure : t Abstract.Value.structure
val mem : 'a Abstract.Value.key -> bool
val get : 'a Abstract.Value.key -> (t -> 'a) option
val set : 'a Abstract.Value.key -> 'a -> t -> t
val reduce : t -> t
end
module type S =
sig
module Val : Value
module Loc :
sig
type value = Val.t
type location
type offset
val top : location
val equal_loc : location -> location -> bool
val equal_offset : offset -> offset -> bool
val pretty_loc : Format.formatter -> location -> unit
val pretty_offset : Format.formatter -> offset -> unit
val to_value : location -> value
val size : location -> Int_Base.t
val assume_no_overlap :
partial:bool ->
location ->
location -> (location * location) Abstract_location.truth
val assume_valid_location :
for_writing:bool ->
bitfield:bool -> location -> location Abstract_location.truth
val no_offset : offset
val forward_field :
Cil_types.typ -> Cil_types.fieldinfo -> offset -> offset
val forward_index : Cil_types.typ -> value -> offset -> offset
val forward_variable :
Cil_types.typ ->
Cil_types.varinfo -> offset -> location Eval.or_bottom
val forward_pointer :
Cil_types.typ -> value -> offset -> location Eval.or_bottom
val eval_varinfo : Cil_types.varinfo -> location
val backward_variable :
Cil_types.varinfo -> location -> offset Eval.or_bottom
val backward_pointer :
value -> offset -> location -> (value * offset) Eval.or_bottom
val backward_field :
Cil_types.typ ->
Cil_types.fieldinfo -> offset -> offset Eval.or_bottom
val backward_index :
Cil_types.typ ->
index:value ->
remaining:offset -> offset -> (value * offset) Eval.or_bottom
val structure : location Abstract.Location.structure
val mem : 'a Abstract.Location.key -> bool
val get : 'a Abstract.Location.key -> (location -> 'a) option
val set : 'a Abstract.Location.key -> 'a -> location -> location
end
module Dom :
sig
type state
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 disjoint : t -> t -> bool
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
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 min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Seq.t
val to_seq : t -> elt Seq.t
val add_seq : elt Seq.t -> t -> t
val of_seq : elt Seq.t -> 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 update : key -> ('a option -> 'a option) -> '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 union :
(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a 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 min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
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 find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Seq.t
val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Seq.t -> 'a 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 top : t
val is_included : t -> t -> bool
val join : t -> t -> t
val widen :
Cil_types.kernel_function -> Cil_types.stmt -> t -> t -> t
val narrow : t -> t -> t Eval.or_bottom
type value = Val.t
type location = Loc.location
type origin
val extract_expr :
(Cil_types.exp -> value Eval.evaluated) ->
t -> Cil_types.exp -> (value * origin option) Eval.evaluated
val extract_lval :
(Cil_types.exp -> value Eval.evaluated) ->
t ->
Cil_types.lval ->
Cil_types.typ ->
location -> (value * origin option) Eval.evaluated
val backward_location :
t ->
Cil_types.lval ->
Cil_types.typ ->
location -> value -> (location * value) Eval.or_bottom
val reduce_further :
t -> Cil_types.exp -> value -> (Cil_types.exp * value) list
val update :
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val assign :
Cil_types.kinstr ->
location Eval.left_value ->
Cil_types.exp ->
(location, value) Eval.assigned ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val assume :
Cil_types.stmt ->
Cil_types.exp ->
bool ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val start_call :
Cil_types.stmt ->
(location, value) Eval.call ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val finalize_call :
Cil_types.stmt ->
(location, value) Eval.call ->
pre:t -> post:t -> t Eval.or_bottom
val show_expr :
(value, location, origin) Abstract_domain.valuation ->
t -> Format.formatter -> Cil_types.exp -> unit
val logic_assign :
(Eval.logic_assign * state) option -> location -> state -> state
val evaluate_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> Alarmset.status
val reduce_by_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> bool -> state Eval.or_bottom
val enter_scope :
Abstract_domain.variable_kind -> Cil_types.varinfo list -> t -> t
val leave_scope :
Cil_types.kernel_function -> Cil_types.varinfo list -> t -> t
val empty : unit -> t
val initialize_variable :
Cil_types.lval ->
location ->
initialized:bool -> Abstract_domain.init_value -> t -> t
val initialize_variable_using_type :
Abstract_domain.variable_kind -> Cil_types.varinfo -> t -> t
val enter_loop : Cil_types.stmt -> state -> state
val incr_loop_counter : Cil_types.stmt -> state -> state
val leave_loop : Cil_types.stmt -> state -> state
val relate :
Cil_types.kernel_function ->
Base.Hptset.t -> t -> Base.SetLattice.t
val filter :
Cil_types.kernel_function ->
[ `Post | `Pre ] -> Base.Hptset.t -> t -> t
val reuse :
Cil_types.kernel_function ->
Base.Hptset.t -> current_input:t -> previous_output:t -> t
val log_category : Value_parameters.category
module Store :
sig
val register_global_state : state Eval.or_bottom -> unit
val register_initial_state :
Value_types.callstack -> state -> unit
val register_state_before_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val register_state_after_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val get_global_state : unit -> state Eval.or_bottom
val get_initial_state :
Cil_types.kernel_function -> state Eval.or_bottom
val get_initial_state_by_callstack :
Cil_types.kernel_function ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
val get_stmt_state :
after:bool -> Cil_types.stmt -> state Eval.or_bottom
val get_stmt_state_by_callstack :
after:bool ->
Cil_types.stmt ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
end
val post_analysis : t Eval.or_bottom -> unit
val structure : t Abstract.Domain.structure
val mem : 'a Abstract.Domain.key -> bool
val get : 'a Abstract.Domain.key -> (t -> 'a) option
val set : 'a Abstract.Domain.key -> 'a -> t -> t
val get_cvalue : (t -> Cvalue.Model.t) option
val get_cvalue_or_top : t -> Cvalue.Model.t
val get_cvalue_or_bottom : t Bottom.or_bottom -> Cvalue.Model.t
end
end
module type Eva =
sig
module Val : Value
module Loc :
sig
type value = Val.t
type location
type offset
val top : location
val equal_loc : location -> location -> bool
val equal_offset : offset -> offset -> bool
val pretty_loc : Format.formatter -> location -> unit
val pretty_offset : Format.formatter -> offset -> unit
val to_value : location -> value
val size : location -> Int_Base.t
val assume_no_overlap :
partial:bool ->
location ->
location -> (location * location) Abstract_location.truth
val assume_valid_location :
for_writing:bool ->
bitfield:bool -> location -> location Abstract_location.truth
val no_offset : offset
val forward_field :
Cil_types.typ -> Cil_types.fieldinfo -> offset -> offset
val forward_index : Cil_types.typ -> value -> offset -> offset
val forward_variable :
Cil_types.typ ->
Cil_types.varinfo -> offset -> location Eval.or_bottom
val forward_pointer :
Cil_types.typ -> value -> offset -> location Eval.or_bottom
val eval_varinfo : Cil_types.varinfo -> location
val backward_variable :
Cil_types.varinfo -> location -> offset Eval.or_bottom
val backward_pointer :
value -> offset -> location -> (value * offset) Eval.or_bottom
val backward_field :
Cil_types.typ ->
Cil_types.fieldinfo -> offset -> offset Eval.or_bottom
val backward_index :
Cil_types.typ ->
index:value ->
remaining:offset -> offset -> (value * offset) Eval.or_bottom
val structure : location Abstract.Location.structure
val mem : 'a Abstract.Location.key -> bool
val get : 'a Abstract.Location.key -> (location -> 'a) option
val set : 'a Abstract.Location.key -> 'a -> location -> location
end
module Dom :
sig
type state
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 disjoint : t -> t -> bool
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
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 min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Seq.t
val to_seq : t -> elt Seq.t
val add_seq : elt Seq.t -> t -> t
val of_seq : elt Seq.t -> 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 update : key -> ('a option -> 'a option) -> '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 union :
(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a 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 min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
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 find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Seq.t
val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Seq.t -> 'a 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 top : t
val is_included : t -> t -> bool
val join : t -> t -> t
val widen :
Cil_types.kernel_function -> Cil_types.stmt -> t -> t -> t
val narrow : t -> t -> t Eval.or_bottom
type value = Val.t
type location = Loc.location
type origin
val extract_expr :
(Cil_types.exp -> value Eval.evaluated) ->
t -> Cil_types.exp -> (value * origin option) Eval.evaluated
val extract_lval :
(Cil_types.exp -> value Eval.evaluated) ->
t ->
Cil_types.lval ->
Cil_types.typ ->
location -> (value * origin option) Eval.evaluated
val backward_location :
t ->
Cil_types.lval ->
Cil_types.typ ->
location -> value -> (location * value) Eval.or_bottom
val reduce_further :
t -> Cil_types.exp -> value -> (Cil_types.exp * value) list
val update :
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val assign :
Cil_types.kinstr ->
location Eval.left_value ->
Cil_types.exp ->
(location, value) Eval.assigned ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val assume :
Cil_types.stmt ->
Cil_types.exp ->
bool ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val start_call :
Cil_types.stmt ->
(location, value) Eval.call ->
(value, location, origin) Abstract_domain.valuation ->
t -> t Eval.or_bottom
val finalize_call :
Cil_types.stmt ->
(location, value) Eval.call ->
pre:t -> post:t -> t Eval.or_bottom
val show_expr :
(value, location, origin) Abstract_domain.valuation ->
t -> Format.formatter -> Cil_types.exp -> unit
val logic_assign :
(Eval.logic_assign * state) option -> location -> state -> state
val evaluate_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> Alarmset.status
val reduce_by_predicate :
state Abstract_domain.logic_environment ->
state -> Cil_types.predicate -> bool -> state Eval.or_bottom
val enter_scope :
Abstract_domain.variable_kind -> Cil_types.varinfo list -> t -> t
val leave_scope :
Cil_types.kernel_function -> Cil_types.varinfo list -> t -> t
val empty : unit -> t
val initialize_variable :
Cil_types.lval ->
location ->
initialized:bool -> Abstract_domain.init_value -> t -> t
val initialize_variable_using_type :
Abstract_domain.variable_kind -> Cil_types.varinfo -> t -> t
val enter_loop : Cil_types.stmt -> state -> state
val incr_loop_counter : Cil_types.stmt -> state -> state
val leave_loop : Cil_types.stmt -> state -> state
val relate :
Cil_types.kernel_function ->
Base.Hptset.t -> t -> Base.SetLattice.t
val filter :
Cil_types.kernel_function ->
[ `Post | `Pre ] -> Base.Hptset.t -> t -> t
val reuse :
Cil_types.kernel_function ->
Base.Hptset.t -> current_input:t -> previous_output:t -> t
val log_category : Value_parameters.category
module Store :
sig
val register_global_state : state Eval.or_bottom -> unit
val register_initial_state :
Value_types.callstack -> state -> unit
val register_state_before_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val register_state_after_stmt :
Value_types.callstack -> Cil_types.stmt -> state -> unit
val get_global_state : unit -> state Eval.or_bottom
val get_initial_state :
Cil_types.kernel_function -> state Eval.or_bottom
val get_initial_state_by_callstack :
Cil_types.kernel_function ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
val get_stmt_state :
after:bool -> Cil_types.stmt -> state Eval.or_bottom
val get_stmt_state_by_callstack :
after:bool ->
Cil_types.stmt ->
state Value_types.Callstack.Hashtbl.t Eval.or_top_or_bottom
end
val post_analysis : t Eval.or_bottom -> unit
val structure : t Abstract.Domain.structure
val mem : 'a Abstract.Domain.key -> bool
val get : 'a Abstract.Domain.key -> (t -> 'a) option
val set : 'a Abstract.Domain.key -> 'a -> t -> t
val get_cvalue : (t -> Cvalue.Model.t) option
val get_cvalue_or_top : t -> Cvalue.Model.t
val get_cvalue_or_bottom : t Bottom.or_bottom -> Cvalue.Model.t
end
module Eval :
sig
type state = Dom.t
type value = Val.t
type origin = Dom.origin
type loc = Loc.location
module Valuation :
sig
type t
type value = value
type origin = origin
type loc = loc
val empty : t
val find :
t ->
Cil_types.exp -> (value, origin) Eval.record_val Eval.or_top
val add :
t -> Cil_types.exp -> (value, origin) Eval.record_val -> t
val fold :
(Cil_types.exp -> (value, origin) Eval.record_val -> 'a -> 'a) ->
t -> 'a -> 'a
val find_loc :
t -> Cil_types.lval -> loc Eval.record_loc Eval.or_top
val remove : t -> Cil_types.exp -> t
val remove_loc : t -> Cil_types.lval -> t
end
val to_domain_valuation :
Valuation.t -> (value, loc, origin) Abstract_domain.valuation
val evaluate :
?valuation:Valuation.t ->
?reduction:bool ->
?subdivnb:int ->
state -> Cil_types.exp -> (Valuation.t * value) Eval.evaluated
val copy_lvalue :
?valuation:Valuation.t ->
?subdivnb:int ->
state ->
Cil_types.lval ->
(Valuation.t * value Eval.flagged_value) Eval.evaluated
val lvaluate :
?valuation:Valuation.t ->
?subdivnb:int ->
for_writing:bool ->
state ->
Cil_types.lval ->
(Valuation.t * loc * Cil_types.typ) Eval.evaluated
val reduce :
?valuation:Valuation.t ->
state -> Cil_types.exp -> bool -> Valuation.t Eval.evaluated
val assume :
?valuation:Valuation.t ->
state -> Cil_types.exp -> value -> Valuation.t Eval.or_bottom
val eval_function_exp :
?subdivnb:int ->
Cil_types.exp ->
?args:Cil_types.exp list ->
state -> (Kernel_function.t * Valuation.t) list Eval.evaluated
val interpret_truth :
alarm:(unit -> Alarms.t) ->
'a -> 'a Abstract_value.truth -> 'a Eval.evaluated
end
end
val register_hook :
((module Abstractions.S) -> (module Abstractions.S)) -> unit
module Config :
sig
type elt = flag * Domain_mode.t option
type t
val empty : t
val is_empty : 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 disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
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 min_elt : t -> elt
val min_elt_opt : t -> elt option
val max_elt : t -> elt
val max_elt_opt : t -> elt option
val choose : t -> elt
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Seq.t
val to_seq : t -> elt Seq.t
val add_seq : elt Seq.t -> t -> t
val of_seq : elt Seq.t -> t
val mem : Abstractions.flag -> t -> bool
val cvalue : Abstractions.flag
val equality : Abstractions.flag
val symbolic_locations : Abstractions.flag
val gauges : Abstractions.flag
val octagon : Abstractions.flag
val bitwise : Abstractions.flag
val inout : Abstractions.flag
val sign : Abstractions.flag
val traces : Abstractions.flag
val printer : Abstractions.flag
val default : t
val legacy : t
end
val configure : unit -> Abstractions.Config.t
val make : Abstractions.Config.t -> (module Abstractions.S)
module Legacy : S
module Default : S
end