sig
type 'a sequence = { pre : 'a; post : 'a; }
type 'a binder = { bind : 'b 'c. 'a -> ('b -> 'c) -> 'b -> 'c; }
type equation = Set of Lang.F.term * Lang.F.term | Assert of Lang.F.pred
type acs = RW | RD | OBJ
type 'a value = Val of Lang.F.term | Loc of 'a
type 'a rloc =
Rloc of Ctypes.c_object * 'a
| Rrange of 'a * Ctypes.c_object * Lang.F.term option *
Lang.F.term option
type 'a sloc =
Sloc of 'a
| Sarray of 'a * Ctypes.c_object * int
| Srange of 'a * Ctypes.c_object * Lang.F.term option *
Lang.F.term option
| Sdescr of Lang.F.var list * 'a * Lang.F.pred
type 'a region = (Ctypes.c_object * 'a Sigs.sloc) list
type 'a logic =
Vexp of Lang.F.term
| Vloc of 'a
| Vset of Vset.set
| Lset of 'a Sigs.sloc list
type scope = Enter | Leave
type 'a result = R_loc of 'a | R_var of Lang.F.var
type polarity = [ `Negative | `NoPolarity | `Positive ]
type frame =
string * Definitions.trigger list * Lang.F.pred list * Lang.F.term *
Lang.F.term
type s_lval = Sigs.s_host * Sigs.s_offset list
and s_host =
Mvar of Cil_types.varinfo
| Mmem of Lang.F.term
| Mval of Sigs.s_lval
and s_offset = Mfield of Cil_types.fieldinfo | Mindex of Lang.F.term
type mval =
Mterm
| Maddr of Sigs.s_lval
| Mlval of Sigs.s_lval * Lang.datakind
| Mchunk of string * Lang.datakind
type update = Mstore of Sigs.s_lval * Lang.F.term
module type Chunk =
sig
type t
val self : string
val hash : Sigs.Chunk.t -> int
val equal : Sigs.Chunk.t -> Sigs.Chunk.t -> bool
val compare : Sigs.Chunk.t -> Sigs.Chunk.t -> int
val pretty : Stdlib.Format.formatter -> Sigs.Chunk.t -> unit
val tau_of_chunk : Sigs.Chunk.t -> Lang.F.tau
val basename_of_chunk : Sigs.Chunk.t -> string
val is_framed : Sigs.Chunk.t -> bool
end
module type Sigma =
sig
type chunk
module Chunk :
sig
type t = chunk
type set
type 'a 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 = Sigs.Sigma.Chunk.Set.t
type t
val pretty : Stdlib.Format.formatter -> Sigs.Sigma.t -> unit
val create : unit -> Sigs.Sigma.t
val mem : Sigs.Sigma.t -> Sigs.Sigma.chunk -> bool
val get : Sigs.Sigma.t -> Sigs.Sigma.chunk -> Lang.F.var
val value : Sigs.Sigma.t -> Sigs.Sigma.chunk -> Lang.F.term
val copy : Sigs.Sigma.t -> Sigs.Sigma.t
val join : Sigs.Sigma.t -> Sigs.Sigma.t -> Passive.t
val assigned :
pre:Sigs.Sigma.t ->
post:Sigs.Sigma.t -> Sigs.Sigma.domain -> Lang.F.pred Bag.t
val choose : Sigs.Sigma.t -> Sigs.Sigma.t -> Sigs.Sigma.t
val merge :
Sigs.Sigma.t -> Sigs.Sigma.t -> Sigs.Sigma.t * Passive.t * Passive.t
val merge_list : Sigs.Sigma.t list -> Sigs.Sigma.t * Passive.t list
val iter :
(Sigs.Sigma.chunk -> Lang.F.var -> unit) -> Sigs.Sigma.t -> unit
val iter2 :
(Sigs.Sigma.chunk -> Lang.F.var option -> Lang.F.var option -> unit) ->
Sigs.Sigma.t -> Sigs.Sigma.t -> unit
val havoc_chunk : Sigs.Sigma.t -> Sigs.Sigma.chunk -> Sigs.Sigma.t
val havoc : Sigs.Sigma.t -> Sigs.Sigma.domain -> Sigs.Sigma.t
val havoc_any : call:bool -> Sigs.Sigma.t -> Sigs.Sigma.t
val remove_chunks : Sigs.Sigma.t -> Sigs.Sigma.domain -> Sigs.Sigma.t
val domain : Sigs.Sigma.t -> Sigs.Sigma.domain
val union : Sigs.Sigma.domain -> Sigs.Sigma.domain -> Sigs.Sigma.domain
val empty : Sigs.Sigma.domain
val writes : Sigs.Sigma.t Sigs.sequence -> Sigs.Sigma.domain
end
module type Model =
sig
val configure : unit -> WpContext.rollback
val configure_ia :
Interpreted_automata.automaton ->
Interpreted_automata.vertex Sigs.binder
val datatype : string
val hypotheses : MemoryContext.partition -> MemoryContext.partition
module Chunk : Chunk
module Heap :
sig
type t = Chunk.t
type set
type 'a 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
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 sequence -> domain
end
type loc
type chunk = Sigs.Chunk.t
type sigma = Sigs.Model.Sigma.t
type domain = Sigs.Model.Sigma.domain
type segment = Sigs.Model.loc Sigs.rloc
type state
val state : Sigs.Model.sigma -> Sigs.Model.state
val lookup : Sigs.Model.state -> Lang.F.term -> Sigs.mval
val updates :
Sigs.Model.state Sigs.sequence -> Lang.F.Vars.t -> Sigs.update Bag.t
val apply :
(Lang.F.term -> Lang.F.term) -> Sigs.Model.state -> Sigs.Model.state
val iter :
(Sigs.mval -> Lang.F.term -> unit) -> Sigs.Model.state -> unit
val pretty : Stdlib.Format.formatter -> Sigs.Model.loc -> unit
val vars : Sigs.Model.loc -> Lang.F.Vars.t
val occurs : Lang.F.var -> Sigs.Model.loc -> bool
val null : Sigs.Model.loc
val literal : eid:int -> Cstring.cst -> Sigs.Model.loc
val cvar : Cil_types.varinfo -> Sigs.Model.loc
val pointer_loc : Lang.F.term -> Sigs.Model.loc
val pointer_val : Sigs.Model.loc -> Lang.F.term
val field : Sigs.Model.loc -> Cil_types.fieldinfo -> Sigs.Model.loc
val shift :
Sigs.Model.loc -> Ctypes.c_object -> Lang.F.term -> Sigs.Model.loc
val base_addr : Sigs.Model.loc -> Sigs.Model.loc
val base_offset : Sigs.Model.loc -> Lang.F.term
val block_length :
Sigs.Model.sigma -> Ctypes.c_object -> Sigs.Model.loc -> Lang.F.term
val cast :
Ctypes.c_object Sigs.sequence -> Sigs.Model.loc -> Sigs.Model.loc
val loc_of_int : Ctypes.c_object -> Lang.F.term -> Sigs.Model.loc
val int_of_loc : Ctypes.c_int -> Sigs.Model.loc -> Lang.F.term
val domain : Ctypes.c_object -> Sigs.Model.loc -> Sigs.Model.domain
val is_well_formed : Sigs.Model.sigma -> Lang.F.pred
val load :
Sigs.Model.sigma ->
Ctypes.c_object -> Sigs.Model.loc -> Sigs.Model.loc Sigs.value
val load_init :
Sigs.Model.sigma -> Ctypes.c_object -> Sigs.Model.loc -> Lang.F.term
val copied :
Sigs.Model.sigma Sigs.sequence ->
Ctypes.c_object ->
Sigs.Model.loc -> Sigs.Model.loc -> Sigs.equation list
val copied_init :
Sigs.Model.sigma Sigs.sequence ->
Ctypes.c_object ->
Sigs.Model.loc -> Sigs.Model.loc -> Sigs.equation list
val stored :
Sigs.Model.sigma Sigs.sequence ->
Ctypes.c_object ->
Sigs.Model.loc -> Lang.F.term -> Sigs.equation list
val stored_init :
Sigs.Model.sigma Sigs.sequence ->
Ctypes.c_object ->
Sigs.Model.loc -> Lang.F.term -> Sigs.equation list
val assigned :
Sigs.Model.sigma Sigs.sequence ->
Ctypes.c_object -> Sigs.Model.loc Sigs.sloc -> Sigs.equation list
val is_null : Sigs.Model.loc -> Lang.F.pred
val loc_eq : Sigs.Model.loc -> Sigs.Model.loc -> Lang.F.pred
val loc_lt : Sigs.Model.loc -> Sigs.Model.loc -> Lang.F.pred
val loc_neq : Sigs.Model.loc -> Sigs.Model.loc -> Lang.F.pred
val loc_leq : Sigs.Model.loc -> Sigs.Model.loc -> Lang.F.pred
val loc_diff :
Ctypes.c_object -> Sigs.Model.loc -> Sigs.Model.loc -> Lang.F.term
val valid :
Sigs.Model.sigma -> Sigs.acs -> Sigs.Model.segment -> Lang.F.pred
val frame : Sigs.Model.sigma -> Lang.F.pred list
val alloc :
Sigs.Model.sigma -> Cil_types.varinfo list -> Sigs.Model.sigma
val initialized : Sigs.Model.sigma -> Sigs.Model.segment -> Lang.F.pred
val invalid : Sigs.Model.sigma -> Sigs.Model.segment -> Lang.F.pred
val scope :
Sigs.Model.sigma Sigs.sequence ->
Sigs.scope -> Cil_types.varinfo list -> Lang.F.pred list
val global : Sigs.Model.sigma -> Lang.F.term -> Lang.F.pred
val included : Sigs.Model.segment -> Sigs.Model.segment -> Lang.F.pred
val separated : Sigs.Model.segment -> Sigs.Model.segment -> Lang.F.pred
end
module type CodeSemantics =
sig
module M : Model
type loc = M.loc
type nonrec value = Sigs.CodeSemantics.loc Sigs.value
type nonrec result = Sigs.CodeSemantics.loc Sigs.result
type sigma = M.Sigma.t
val pp_value :
Stdlib.Format.formatter -> Sigs.CodeSemantics.value -> unit
val cval : Sigs.CodeSemantics.value -> Lang.F.term
val cloc : Sigs.CodeSemantics.value -> Sigs.CodeSemantics.loc
val cast :
Cil_types.typ ->
Cil_types.typ -> Sigs.CodeSemantics.value -> Sigs.CodeSemantics.value
val equal_typ :
Cil_types.typ ->
Sigs.CodeSemantics.value -> Sigs.CodeSemantics.value -> Lang.F.pred
val not_equal_typ :
Cil_types.typ ->
Sigs.CodeSemantics.value -> Sigs.CodeSemantics.value -> Lang.F.pred
val equal_obj :
Ctypes.c_object ->
Sigs.CodeSemantics.value -> Sigs.CodeSemantics.value -> Lang.F.pred
val not_equal_obj :
Ctypes.c_object ->
Sigs.CodeSemantics.value -> Sigs.CodeSemantics.value -> Lang.F.pred
val exp :
Sigs.CodeSemantics.sigma -> Cil_types.exp -> Sigs.CodeSemantics.value
val cond : Sigs.CodeSemantics.sigma -> Cil_types.exp -> Lang.F.pred
val lval :
Sigs.CodeSemantics.sigma -> Cil_types.lval -> Sigs.CodeSemantics.loc
val call :
Sigs.CodeSemantics.sigma -> Cil_types.exp -> Sigs.CodeSemantics.loc
val instance_of :
Sigs.CodeSemantics.loc -> Cil_types.kernel_function -> Lang.F.pred
val loc_of_exp :
Sigs.CodeSemantics.sigma -> Cil_types.exp -> Sigs.CodeSemantics.loc
val val_of_exp :
Sigs.CodeSemantics.sigma -> Cil_types.exp -> Lang.F.term
val result :
Sigs.CodeSemantics.sigma ->
Cil_types.typ -> Sigs.CodeSemantics.result -> Lang.F.term
val return :
Sigs.CodeSemantics.sigma ->
Cil_types.typ -> Cil_types.exp -> Lang.F.term
val is_zero :
Sigs.CodeSemantics.sigma ->
Ctypes.c_object -> Sigs.CodeSemantics.loc -> Lang.F.pred
val is_exp_range :
Sigs.CodeSemantics.sigma ->
Sigs.CodeSemantics.loc ->
Ctypes.c_object ->
Lang.F.term ->
Lang.F.term -> Sigs.CodeSemantics.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 * Lang.F.pred)
val init :
sigma:M.sigma ->
Cil_types.varinfo ->
Cil_types.init option -> Sigs.CodeSemantics.warned_hyp list
end
module type LogicSemantics =
sig
module M : Model
type loc = M.loc
type nonrec value = M.loc Sigs.value
type nonrec logic = M.loc Sigs.logic
type nonrec region = M.loc Sigs.region
type nonrec result = M.loc Sigs.result
type sigma = M.Sigma.t
type frame
val pp_frame :
Stdlib.Format.formatter -> Sigs.LogicSemantics.frame -> unit
val get_frame : unit -> Sigs.LogicSemantics.frame
val in_frame : Sigs.LogicSemantics.frame -> ('a -> 'b) -> 'a -> 'b
val mem_at_frame :
Sigs.LogicSemantics.frame ->
Clabels.c_label -> Sigs.LogicSemantics.sigma
val set_at_frame :
Sigs.LogicSemantics.frame ->
Clabels.c_label -> Sigs.LogicSemantics.sigma -> unit
val has_at_frame : Sigs.LogicSemantics.frame -> Clabels.c_label -> bool
val mem_frame : Clabels.c_label -> Sigs.LogicSemantics.sigma
val mk_frame :
?kf:Cil_types.kernel_function ->
?result:Sigs.LogicSemantics.result ->
?status:Lang.F.var ->
?formals:Sigs.LogicSemantics.value Cil_datatype.Varinfo.Map.t ->
?labels:Sigs.LogicSemantics.sigma Clabels.LabelMap.t ->
?descr:string -> unit -> Sigs.LogicSemantics.frame
val local : descr:string -> Sigs.LogicSemantics.frame
val frame : Cil_types.kernel_function -> Sigs.LogicSemantics.frame
type call
val call :
?result:M.loc ->
Cil_types.kernel_function ->
Sigs.LogicSemantics.value list -> Sigs.LogicSemantics.call
val call_pre :
Sigs.LogicSemantics.sigma ->
Sigs.LogicSemantics.call ->
Sigs.LogicSemantics.sigma -> Sigs.LogicSemantics.frame
val call_post :
Sigs.LogicSemantics.sigma ->
Sigs.LogicSemantics.call ->
Sigs.LogicSemantics.sigma Sigs.sequence -> Sigs.LogicSemantics.frame
val return : unit -> Cil_types.typ
val result : unit -> Sigs.LogicSemantics.result
val status : unit -> Lang.F.var
val guards : Sigs.LogicSemantics.frame -> Lang.F.pred list
type env
val mk_env :
?here:Sigs.LogicSemantics.sigma ->
?lvars:Cil_types.logic_var list -> unit -> Sigs.LogicSemantics.env
val current : Sigs.LogicSemantics.env -> Sigs.LogicSemantics.sigma
val move_at :
Sigs.LogicSemantics.env ->
Sigs.LogicSemantics.sigma -> Sigs.LogicSemantics.env
val mem_at :
Sigs.LogicSemantics.env ->
Clabels.c_label -> Sigs.LogicSemantics.sigma
val env_at :
Sigs.LogicSemantics.env -> Clabels.c_label -> Sigs.LogicSemantics.env
val lval :
Sigs.LogicSemantics.env ->
Cil_types.term_lval -> Cil_types.typ * M.loc
val term : Sigs.LogicSemantics.env -> Cil_types.term -> Lang.F.term
val pred :
Sigs.polarity ->
Sigs.LogicSemantics.env -> Cil_types.predicate -> Lang.F.pred
val call_pred :
Sigs.LogicSemantics.env ->
Cil_types.logic_info ->
Cil_types.logic_label list -> Lang.F.term list -> Lang.F.pred
val region :
Sigs.LogicSemantics.env ->
Cil_types.term -> Sigs.LogicSemantics.region
val assigned_of_lval :
Sigs.LogicSemantics.env ->
Cil_types.lval -> Sigs.LogicSemantics.region
val assigned_of_froms :
Sigs.LogicSemantics.env ->
Cil_types.from list -> Sigs.LogicSemantics.region
val assigned_of_assigns :
Sigs.LogicSemantics.env ->
Cil_types.assigns -> Sigs.LogicSemantics.region option
val val_of_term :
Sigs.LogicSemantics.env -> Cil_types.term -> Lang.F.term
val loc_of_term :
Sigs.LogicSemantics.env -> Cil_types.term -> Sigs.LogicSemantics.loc
val lemma : LogicUsage.logic_lemma -> Definitions.dlemma
val vars : Sigs.LogicSemantics.region -> Lang.F.Vars.t
val occurs : Lang.F.var -> Sigs.LogicSemantics.region -> bool
val check_assigns :
unfold:int ->
Sigs.LogicSemantics.sigma ->
written:Sigs.LogicSemantics.region ->
assignable:Sigs.LogicSemantics.region -> Lang.F.pred
end
module type LogicAssigns =
sig
module M : Model
module L :
sig
module M :
sig
val configure : unit -> WpContext.rollback
val configure_ia :
Interpreted_automata.automaton ->
Interpreted_automata.vertex binder
val datatype : string
val hypotheses :
MemoryContext.partition -> MemoryContext.partition
module Chunk :
sig
type t = M.Chunk.t
val self : string
val hash : t -> int
val equal : t -> t -> bool
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 sequence -> domain
end
type loc = M.loc
type chunk = Chunk.t
type sigma = Sigma.t
type domain = Sigma.domain
type segment = loc rloc
type state = M.state
val state : sigma -> state
val lookup : state -> Lang.F.term -> mval
val updates : state sequence -> Lang.F.Vars.t -> update Bag.t
val apply : (Lang.F.term -> Lang.F.term) -> state -> state
val iter : (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 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 is_well_formed : sigma -> Lang.F.pred
val load : sigma -> Ctypes.c_object -> loc -> loc value
val load_init : sigma -> Ctypes.c_object -> loc -> Lang.F.term
val copied :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val copied_init :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val stored :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val stored_init :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val assigned :
sigma sequence ->
Ctypes.c_object -> loc sloc -> equation 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 -> acs -> segment -> Lang.F.pred
val frame : sigma -> Lang.F.pred list
val alloc : sigma -> Cil_types.varinfo list -> sigma
val initialized : sigma -> segment -> Lang.F.pred
val invalid : sigma -> segment -> Lang.F.pred
val scope :
sigma sequence ->
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 = M.loc value
type nonrec logic = M.loc logic
type nonrec region = M.loc region
type nonrec result = M.loc result
type sigma = M.Sigma.t
type frame
val pp_frame : Format.formatter -> frame -> unit
val get_frame : unit -> frame
val in_frame : frame -> ('a -> 'b) -> 'a -> 'b
val mem_at_frame : frame -> Clabels.c_label -> sigma
val set_at_frame : frame -> Clabels.c_label -> sigma -> unit
val has_at_frame : frame -> Clabels.c_label -> bool
val mem_frame : Clabels.c_label -> sigma
val mk_frame :
?kf:Cil_types.kernel_function ->
?result:result ->
?status:Lang.F.var ->
?formals:value Cil_datatype.Varinfo.Map.t ->
?labels:sigma Clabels.LabelMap.t ->
?descr:string -> unit -> frame
val local : descr:string -> frame
val frame : Cil_types.kernel_function -> frame
type call
val call :
?result:M.loc -> Cil_types.kernel_function -> value list -> call
val call_pre : sigma -> call -> sigma -> frame
val call_post : sigma -> call -> sigma sequence -> frame
val return : unit -> Cil_types.typ
val result : unit -> result
val status : unit -> Lang.F.var
val guards : frame -> Lang.F.pred list
type env
val mk_env :
?here:sigma -> ?lvars:Cil_types.logic_var list -> unit -> env
val current : env -> sigma
val move_at : env -> sigma -> env
val mem_at : env -> Clabels.c_label -> sigma
val env_at : env -> Clabels.c_label -> env
val lval : env -> Cil_types.term_lval -> Cil_types.typ * M.loc
val term : env -> Cil_types.term -> Lang.F.term
val pred : polarity -> env -> Cil_types.predicate -> Lang.F.pred
val call_pred :
env ->
Cil_types.logic_info ->
Cil_types.logic_label list -> Lang.F.term list -> Lang.F.pred
val region : env -> Cil_types.term -> region
val assigned_of_lval : env -> Cil_types.lval -> region
val assigned_of_froms : env -> Cil_types.from list -> region
val assigned_of_assigns : env -> Cil_types.assigns -> region option
val val_of_term : env -> Cil_types.term -> Lang.F.term
val loc_of_term : env -> Cil_types.term -> loc
val lemma : LogicUsage.logic_lemma -> Definitions.dlemma
val vars : region -> Lang.F.Vars.t
val occurs : Lang.F.var -> region -> bool
val check_assigns :
unfold:int ->
sigma -> written:region -> assignable:region -> Lang.F.pred
end
val domain : M.loc Sigs.region -> M.Heap.set
val apply_assigns :
M.sigma Sigs.sequence -> M.loc Sigs.region -> Lang.F.pred list
end
module type Compiler =
sig
module M : Model
module C :
sig
module M :
sig
val configure : unit -> WpContext.rollback
val configure_ia :
Interpreted_automata.automaton ->
Interpreted_automata.vertex binder
val datatype : string
val hypotheses :
MemoryContext.partition -> MemoryContext.partition
module Chunk :
sig
type t = M.Chunk.t
val self : string
val hash : t -> int
val equal : t -> t -> bool
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 sequence -> domain
end
type loc = M.loc
type chunk = Chunk.t
type sigma = Sigma.t
type domain = Sigma.domain
type segment = loc rloc
type state = M.state
val state : sigma -> state
val lookup : state -> Lang.F.term -> mval
val updates : state sequence -> Lang.F.Vars.t -> update Bag.t
val apply : (Lang.F.term -> Lang.F.term) -> state -> state
val iter : (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 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 is_well_formed : sigma -> Lang.F.pred
val load : sigma -> Ctypes.c_object -> loc -> loc value
val load_init : sigma -> Ctypes.c_object -> loc -> Lang.F.term
val copied :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val copied_init :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val stored :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val stored_init :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val assigned :
sigma sequence ->
Ctypes.c_object -> loc sloc -> equation 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 -> acs -> segment -> Lang.F.pred
val frame : sigma -> Lang.F.pred list
val alloc : sigma -> Cil_types.varinfo list -> sigma
val initialized : sigma -> segment -> Lang.F.pred
val invalid : sigma -> segment -> Lang.F.pred
val scope :
sigma sequence ->
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 value
type nonrec result = loc 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 * Lang.F.pred)
val init :
sigma:M.sigma ->
Cil_types.varinfo -> Cil_types.init option -> warned_hyp list
end
module L :
sig
module M :
sig
val configure : unit -> WpContext.rollback
val configure_ia :
Interpreted_automata.automaton ->
Interpreted_automata.vertex binder
val datatype : string
val hypotheses :
MemoryContext.partition -> MemoryContext.partition
module Chunk :
sig
type t = M.Chunk.t
val self : string
val hash : t -> int
val equal : t -> t -> bool
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 sequence -> domain
end
type loc = M.loc
type chunk = Chunk.t
type sigma = Sigma.t
type domain = Sigma.domain
type segment = loc rloc
type state = M.state
val state : sigma -> state
val lookup : state -> Lang.F.term -> mval
val updates : state sequence -> Lang.F.Vars.t -> update Bag.t
val apply : (Lang.F.term -> Lang.F.term) -> state -> state
val iter : (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 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 is_well_formed : sigma -> Lang.F.pred
val load : sigma -> Ctypes.c_object -> loc -> loc value
val load_init : sigma -> Ctypes.c_object -> loc -> Lang.F.term
val copied :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val copied_init :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val stored :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val stored_init :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val assigned :
sigma sequence ->
Ctypes.c_object -> loc sloc -> equation 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 -> acs -> segment -> Lang.F.pred
val frame : sigma -> Lang.F.pred list
val alloc : sigma -> Cil_types.varinfo list -> sigma
val initialized : sigma -> segment -> Lang.F.pred
val invalid : sigma -> segment -> Lang.F.pred
val scope :
sigma sequence ->
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 = M.loc value
type nonrec logic = M.loc logic
type nonrec region = M.loc region
type nonrec result = M.loc result
type sigma = M.Sigma.t
type frame
val pp_frame : Format.formatter -> frame -> unit
val get_frame : unit -> frame
val in_frame : frame -> ('a -> 'b) -> 'a -> 'b
val mem_at_frame : frame -> Clabels.c_label -> sigma
val set_at_frame : frame -> Clabels.c_label -> sigma -> unit
val has_at_frame : frame -> Clabels.c_label -> bool
val mem_frame : Clabels.c_label -> sigma
val mk_frame :
?kf:Cil_types.kernel_function ->
?result:result ->
?status:Lang.F.var ->
?formals:value Cil_datatype.Varinfo.Map.t ->
?labels:sigma Clabels.LabelMap.t ->
?descr:string -> unit -> frame
val local : descr:string -> frame
val frame : Cil_types.kernel_function -> frame
type call
val call :
?result:M.loc -> Cil_types.kernel_function -> value list -> call
val call_pre : sigma -> call -> sigma -> frame
val call_post : sigma -> call -> sigma sequence -> frame
val return : unit -> Cil_types.typ
val result : unit -> result
val status : unit -> Lang.F.var
val guards : frame -> Lang.F.pred list
type env
val mk_env :
?here:sigma -> ?lvars:Cil_types.logic_var list -> unit -> env
val current : env -> sigma
val move_at : env -> sigma -> env
val mem_at : env -> Clabels.c_label -> sigma
val env_at : env -> Clabels.c_label -> env
val lval : env -> Cil_types.term_lval -> Cil_types.typ * M.loc
val term : env -> Cil_types.term -> Lang.F.term
val pred : polarity -> env -> Cil_types.predicate -> Lang.F.pred
val call_pred :
env ->
Cil_types.logic_info ->
Cil_types.logic_label list -> Lang.F.term list -> Lang.F.pred
val region : env -> Cil_types.term -> region
val assigned_of_lval : env -> Cil_types.lval -> region
val assigned_of_froms : env -> Cil_types.from list -> region
val assigned_of_assigns : env -> Cil_types.assigns -> region option
val val_of_term : env -> Cil_types.term -> Lang.F.term
val loc_of_term : env -> Cil_types.term -> loc
val lemma : LogicUsage.logic_lemma -> Definitions.dlemma
val vars : region -> Lang.F.Vars.t
val occurs : Lang.F.var -> region -> bool
val check_assigns :
unfold:int ->
sigma -> written:region -> assignable:region -> Lang.F.pred
end
module A :
sig
module M :
sig
val configure : unit -> WpContext.rollback
val configure_ia :
Interpreted_automata.automaton ->
Interpreted_automata.vertex binder
val datatype : string
val hypotheses :
MemoryContext.partition -> MemoryContext.partition
module Chunk :
sig
type t = M.Chunk.t
val self : string
val hash : t -> int
val equal : t -> t -> bool
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 sequence -> domain
end
type loc = M.loc
type chunk = Chunk.t
type sigma = Sigma.t
type domain = Sigma.domain
type segment = loc rloc
type state = M.state
val state : sigma -> state
val lookup : state -> Lang.F.term -> mval
val updates : state sequence -> Lang.F.Vars.t -> update Bag.t
val apply : (Lang.F.term -> Lang.F.term) -> state -> state
val iter : (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 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 is_well_formed : sigma -> Lang.F.pred
val load : sigma -> Ctypes.c_object -> loc -> loc value
val load_init : sigma -> Ctypes.c_object -> loc -> Lang.F.term
val copied :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val copied_init :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val stored :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val stored_init :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val assigned :
sigma sequence ->
Ctypes.c_object -> loc sloc -> equation 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 -> acs -> segment -> Lang.F.pred
val frame : sigma -> Lang.F.pred list
val alloc : sigma -> Cil_types.varinfo list -> sigma
val initialized : sigma -> segment -> Lang.F.pred
val invalid : sigma -> segment -> Lang.F.pred
val scope :
sigma sequence ->
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
module L :
sig
module M :
sig
val configure : unit -> WpContext.rollback
val configure_ia :
Interpreted_automata.automaton ->
Interpreted_automata.vertex binder
val datatype : string
val hypotheses :
MemoryContext.partition -> MemoryContext.partition
module Chunk :
sig
type t = M.Chunk.t
val self : string
val hash : t -> int
val equal : t -> t -> bool
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 sequence -> domain
end
type loc = M.loc
type chunk = Chunk.t
type sigma = Sigma.t
type domain = Sigma.domain
type segment = loc rloc
type state = M.state
val state : sigma -> state
val lookup : state -> Lang.F.term -> mval
val updates :
state sequence -> Lang.F.Vars.t -> update Bag.t
val apply : (Lang.F.term -> Lang.F.term) -> state -> state
val iter : (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 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 is_well_formed : sigma -> Lang.F.pred
val load : sigma -> Ctypes.c_object -> loc -> loc value
val load_init :
sigma -> Ctypes.c_object -> loc -> Lang.F.term
val copied :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val copied_init :
sigma sequence ->
Ctypes.c_object -> loc -> loc -> equation list
val stored :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val stored_init :
sigma sequence ->
Ctypes.c_object -> loc -> Lang.F.term -> equation list
val assigned :
sigma sequence ->
Ctypes.c_object -> loc sloc -> equation 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 -> acs -> segment -> Lang.F.pred
val frame : sigma -> Lang.F.pred list
val alloc : sigma -> Cil_types.varinfo list -> sigma
val initialized : sigma -> segment -> Lang.F.pred
val invalid : sigma -> segment -> Lang.F.pred
val scope :
sigma sequence ->
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 = M.loc value
type nonrec logic = M.loc logic
type nonrec region = M.loc region
type nonrec result = M.loc result
type sigma = M.Sigma.t
type frame = L.frame
val pp_frame : Format.formatter -> frame -> unit
val get_frame : unit -> frame
val in_frame : frame -> ('a -> 'b) -> 'a -> 'b
val mem_at_frame : frame -> Clabels.c_label -> sigma
val set_at_frame : frame -> Clabels.c_label -> sigma -> unit
val has_at_frame : frame -> Clabels.c_label -> bool
val mem_frame : Clabels.c_label -> sigma
val mk_frame :
?kf:Cil_types.kernel_function ->
?result:result ->
?status:Lang.F.var ->
?formals:value Cil_datatype.Varinfo.Map.t ->
?labels:sigma Clabels.LabelMap.t ->
?descr:string -> unit -> frame
val local : descr:string -> frame
val frame : Cil_types.kernel_function -> frame
type call = L.call
val call :
?result:M.loc ->
Cil_types.kernel_function -> value list -> call
val call_pre : sigma -> call -> sigma -> frame
val call_post : sigma -> call -> sigma sequence -> frame
val return : unit -> Cil_types.typ
val result : unit -> result
val status : unit -> Lang.F.var
val guards : frame -> Lang.F.pred list
type env = L.env
val mk_env :
?here:sigma -> ?lvars:Cil_types.logic_var list -> unit -> env
val current : env -> sigma
val move_at : env -> sigma -> env
val mem_at : env -> Clabels.c_label -> sigma
val env_at : env -> Clabels.c_label -> env
val lval : env -> Cil_types.term_lval -> Cil_types.typ * M.loc
val term : env -> Cil_types.term -> Lang.F.term
val pred :
polarity -> env -> Cil_types.predicate -> Lang.F.pred
val call_pred :
env ->
Cil_types.logic_info ->
Cil_types.logic_label list -> Lang.F.term list -> Lang.F.pred
val region : env -> Cil_types.term -> region
val assigned_of_lval : env -> Cil_types.lval -> region
val assigned_of_froms : env -> Cil_types.from list -> region
val assigned_of_assigns :
env -> Cil_types.assigns -> region option
val val_of_term : env -> Cil_types.term -> Lang.F.term
val loc_of_term : env -> Cil_types.term -> loc
val lemma : LogicUsage.logic_lemma -> Definitions.dlemma
val vars : region -> Lang.F.Vars.t
val occurs : Lang.F.var -> region -> bool
val check_assigns :
unfold:int ->
sigma -> written:region -> assignable:region -> Lang.F.pred
end
val domain : M.loc region -> M.Heap.set
val apply_assigns :
M.sigma sequence -> M.loc region -> Lang.F.pred list
end
end
end