functor (M : Sigs.Model) ->
sig
module M :
sig
val configure : Model.tuning
val configure_ia :
Interpreted_automata.automaton ->
Interpreted_automata.vertex Sigs.binder
val datatype : string
val hypotheses : unit -> MemoryContext.clause list
module Chunk :
sig
type t = M.Chunk.t
val self : string
val hash : t -> int
val compare : t -> t -> int
val pretty : Format.formatter -> t -> unit
val tau_of_chunk : t -> Lang.F.tau
val basename_of_chunk : t -> string
val is_framed : t -> bool
end
module Heap :
sig
type t = Chunk.t
type set = M.Heap.set
type 'a map = 'a M.Heap.map
val hash : t -> int
val equal : t -> t -> bool
val compare : t -> t -> int
module Map :
sig
type key = t
type 'a t = 'a map
val empty : 'a t
val add : key -> 'a -> 'a t -> 'a t
val mem : key -> 'a t -> bool
val find : key -> 'a t -> 'a
val findk : key -> 'a t -> key * 'a
val size : 'a t -> int
val is_empty : 'a t -> bool
val insert :
(key -> 'a -> 'a -> 'a) -> key -> 'a -> 'a t -> 'a t
val change :
(key -> 'b -> 'a option -> 'a option) ->
key -> 'b -> 'a t -> 'a t
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val mapf : (key -> 'a -> 'b option) -> 'a t -> 'b t
val mapq : (key -> 'a -> 'a option) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted : (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val union : (key -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val inter : (key -> 'a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val interf :
(key -> 'a -> 'b -> 'c option) -> 'a t -> 'b t -> 'c t
val interq :
(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val diffq :
(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val subset :
(key -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iterk : (key -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
val iter2 :
(key -> 'a option -> 'b option -> unit) ->
'a t -> 'b t -> unit
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
type domain = set
val domain : 'a t -> domain
end
module Set :
sig
type elt = t
type t = set
val empty : t
val add : elt -> t -> t
val singleton : elt -> t
val elements : t -> elt list
val is_empty : t -> bool
val mem : elt -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val iter_sorted : (elt -> unit) -> t -> unit
val fold_sorted : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val subset : t -> t -> bool
val intersect : t -> t -> bool
val of_list : elt list -> t
type 'a mapping = 'a map
val mapping : (elt -> 'a) -> t -> 'a mapping
end
end
module Sigma :
sig
type chunk = Chunk.t
module Chunk :
sig
type t = Chunk.t
type set = Heap.set
type 'a map = 'a Heap.map
val hash : t -> int
val equal : t -> t -> bool
val compare : t -> t -> int
module Map :
sig
type key = t
type 'a t = 'a map
val empty : 'a t
val add : key -> 'a -> 'a t -> 'a t
val mem : key -> 'a t -> bool
val find : key -> 'a t -> 'a
val findk : key -> 'a t -> key * 'a
val size : 'a t -> int
val is_empty : 'a t -> bool
val insert :
(key -> 'a -> 'a -> 'a) -> key -> 'a -> 'a t -> 'a t
val change :
(key -> 'b -> 'a option -> 'a option) ->
key -> 'b -> 'a t -> 'a t
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val mapf : (key -> 'a -> 'b option) -> 'a t -> 'b t
val mapq : (key -> 'a -> 'a option) -> 'a t -> 'a t
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition :
(key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val iter_sorted : (key -> 'a -> unit) -> 'a t -> unit
val fold_sorted :
(key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val union :
(key -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val inter :
(key -> 'a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val interf :
(key -> 'a -> 'b -> 'c option) -> 'a t -> 'b t -> 'c t
val interq :
(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val diffq :
(key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val subset :
(key -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iterk :
(key -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
val iter2 :
(key -> 'a option -> 'b option -> unit) ->
'a t -> 'b t -> unit
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
type domain = set
val domain : 'a t -> domain
end
module Set :
sig
type elt = t
type t = set
val empty : t
val add : elt -> t -> t
val singleton : elt -> t
val elements : t -> elt list
val is_empty : t -> bool
val mem : elt -> t -> bool
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val filter : (elt -> bool) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val iter_sorted : (elt -> unit) -> t -> unit
val fold_sorted : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val subset : t -> t -> bool
val intersect : t -> t -> bool
val of_list : elt list -> t
type 'a mapping = 'a map
val mapping : (elt -> 'a) -> t -> 'a mapping
end
end
type domain = Chunk.Set.t
type t = M.Sigma.t
val pretty : Format.formatter -> t -> unit
val create : unit -> t
val mem : t -> chunk -> bool
val get : t -> chunk -> Lang.F.var
val value : t -> chunk -> Lang.F.term
val copy : t -> t
val join : t -> t -> Passive.t
val assigned : pre:t -> post:t -> domain -> Lang.F.pred Bag.t
val choose : t -> t -> t
val merge : t -> t -> t * Passive.t * Passive.t
val merge_list : t list -> t * Passive.t list
val iter : (chunk -> Lang.F.var -> unit) -> t -> unit
val iter2 :
(chunk -> Lang.F.var option -> Lang.F.var option -> unit) ->
t -> t -> unit
val havoc_chunk : t -> chunk -> t
val havoc : t -> domain -> t
val havoc_any : call:bool -> t -> t
val remove_chunks : t -> domain -> t
val domain : t -> domain
val union : domain -> domain -> domain
val empty : domain
val writes : t Sigs.sequence -> domain
end
type loc = M.loc
type chunk = Chunk.t
type sigma = Sigma.t
type domain = Sigma.domain
type segment = loc Sigs.rloc
type state = M.state
val state : sigma -> state
val lookup : state -> Lang.F.term -> Sigs.mval
val updates :
state Sigs.sequence -> Lang.F.Vars.t -> Sigs.update Bag.t
val apply : (Lang.F.term -> Lang.F.term) -> state -> state
val iter : (Sigs.mval -> Lang.F.term -> unit) -> state -> unit
val pretty : Format.formatter -> loc -> unit
val vars : loc -> Lang.F.Vars.t
val occurs : Lang.F.var -> loc -> bool
val null : loc
val literal : eid:int -> Cstring.cst -> loc
val cvar : Cil_types.varinfo -> loc
val pointer_loc : Lang.F.term -> loc
val pointer_val : loc -> Lang.F.term
val field : loc -> Cil_types.fieldinfo -> loc
val shift : loc -> Ctypes.c_object -> Lang.F.term -> loc
val base_addr : loc -> loc
val base_offset : loc -> Lang.F.term
val block_length : sigma -> Ctypes.c_object -> loc -> Lang.F.term
val cast : Ctypes.c_object Sigs.sequence -> loc -> loc
val loc_of_int : Ctypes.c_object -> Lang.F.term -> loc
val int_of_loc : Ctypes.c_int -> loc -> Lang.F.term
val domain : Ctypes.c_object -> loc -> domain
val load : sigma -> Ctypes.c_object -> loc -> loc Sigs.value
val copied :
sigma Sigs.sequence ->
Ctypes.c_object -> loc -> loc -> Sigs.equation list
val stored :
sigma Sigs.sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> Sigs.equation list
val assigned :
sigma Sigs.sequence ->
Ctypes.c_object -> loc Sigs.sloc -> Lang.F.pred list
val is_null : loc -> Lang.F.pred
val loc_eq : loc -> loc -> Lang.F.pred
val loc_lt : loc -> loc -> Lang.F.pred
val loc_neq : loc -> loc -> Lang.F.pred
val loc_leq : loc -> loc -> Lang.F.pred
val loc_diff : Ctypes.c_object -> loc -> loc -> Lang.F.term
val valid : sigma -> Sigs.acs -> segment -> Lang.F.pred
val frame : sigma -> Lang.F.pred list
val alloc : sigma -> Cil_types.varinfo list -> sigma
val invalid : sigma -> segment -> Lang.F.pred
val scope :
sigma Sigs.sequence ->
Sigs.scope -> Cil_types.varinfo list -> Lang.F.pred list
val global : sigma -> Lang.F.term -> Lang.F.pred
val included : segment -> segment -> Lang.F.pred
val separated : segment -> segment -> Lang.F.pred
end
type loc = M.loc
type nonrec value = loc Sigs.value
type nonrec result = loc Sigs.result
type sigma = M.Sigma.t
val pp_value : Format.formatter -> value -> unit
val cval : value -> Lang.F.term
val cloc : value -> loc
val cast : Cil_types.typ -> Cil_types.typ -> value -> value
val equal_typ : Cil_types.typ -> value -> value -> Lang.F.pred
val not_equal_typ : Cil_types.typ -> value -> value -> Lang.F.pred
val equal_obj : Ctypes.c_object -> value -> value -> Lang.F.pred
val not_equal_obj : Ctypes.c_object -> value -> value -> Lang.F.pred
val exp : sigma -> Cil_types.exp -> value
val cond : sigma -> Cil_types.exp -> Lang.F.pred
val lval : sigma -> Cil_types.lval -> loc
val call : sigma -> Cil_types.exp -> loc
val instance_of : loc -> Cil_types.kernel_function -> Lang.F.pred
val loc_of_exp : sigma -> Cil_types.exp -> loc
val val_of_exp : sigma -> Cil_types.exp -> Lang.F.term
val result : sigma -> Cil_types.typ -> result -> Lang.F.term
val return : sigma -> Cil_types.typ -> Cil_types.exp -> Lang.F.term
val is_zero : sigma -> Ctypes.c_object -> loc -> Lang.F.pred
val is_exp_range :
sigma ->
loc ->
Ctypes.c_object ->
Lang.F.term -> Lang.F.term -> value option -> Lang.F.pred
val unchanged : M.sigma -> M.sigma -> Cil_types.varinfo -> Lang.F.pred
type warned_hyp = Warning.Set.t * Lang.F.pred
val init :
sigma:M.sigma ->
Cil_types.varinfo -> Cil_types.init option -> warned_hyp list
end