sig
type behavior_or_loop =
Id_contract of Datatype.String.Set.t * Cil_types.funbehavior
| Id_loop of Cil_types.code_annotation
type identified_code_annotation = {
ica_kf : Cil_types.kernel_function;
ica_stmt : Cil_types.stmt;
ica_ca : Cil_types.code_annotation;
}
type identified_assigns = {
ias_kf : Cil_types.kernel_function;
ias_kinstr : Cil_types.kinstr;
ias_bhv : Property.behavior_or_loop;
ias_froms : Cil_types.from list;
}
type identified_allocation = {
ial_kf : Cil_types.kernel_function;
ial_kinstr : Cil_types.kinstr;
ial_bhv : Property.behavior_or_loop;
ial_allocs :
Cil_types.identified_term list * Cil_types.identified_term list;
}
type identified_from = {
if_kf : Cil_types.kernel_function;
if_kinstr : Cil_types.kinstr;
if_bhv : Property.behavior_or_loop;
if_from : Cil_types.from;
}
type identified_decrease = {
id_kf : Cil_types.kernel_function;
id_kinstr : Cil_types.kinstr;
id_ca : Cil_types.code_annotation option;
id_variant : Cil_types.variant;
}
type identified_behavior = {
ib_kf : Cil_types.kernel_function;
ib_kinstr : Cil_types.kinstr;
ib_active : Datatype.String.Set.t;
ib_bhv : Cil_types.funbehavior;
}
type identified_complete = {
ic_kf : Cil_types.kernel_function;
ic_kinstr : Cil_types.kinstr;
ic_active : Datatype.String.Set.t;
ic_bhvs : Datatype.String.Set.t;
}
type identified_disjoint = Property.identified_complete
type predicate_kind = private
PKRequires of Cil_types.funbehavior
| PKAssumes of Cil_types.funbehavior
| PKEnsures of Cil_types.funbehavior * Cil_types.termination_kind
| PKTerminates
type identified_predicate = {
ip_kind : Property.predicate_kind;
ip_kf : Cil_types.kernel_function;
ip_kinstr : Cil_types.kinstr;
ip_pred : Cil_types.identified_predicate;
}
type program_point = Before | After
type identified_reachable = {
ir_kf : Cil_types.kernel_function option;
ir_kinstr : Cil_types.kinstr;
ir_program_point : Property.program_point;
}
type other_loc =
OLContract of Cil_types.kernel_function
| OLStmt of Cil_types.kernel_function * Cil_types.stmt
| OLGlob of Cil_types.location
type extended_loc =
ELContract of Cil_types.kernel_function
| ELStmt of Cil_types.kernel_function * Cil_types.stmt
| ELGlob
type identified_extended = {
ie_loc : Property.extended_loc;
ie_ext : Cil_types.acsl_extension;
}
and identified_axiomatic = {
iax_name : string;
iax_props : Property.identified_property list;
iax_attrs : Cil_types.attributes;
}
and identified_lemma = {
il_name : string;
il_labels : Cil_types.logic_label list;
il_args : string list;
il_pred : Cil_types.toplevel_predicate;
il_attrs : Cil_types.attributes;
il_loc : Cil_types.location;
}
and identified_instance = {
ii_kf : Cil_types.kernel_function;
ii_stmt : Cil_types.stmt;
ii_pred : Cil_types.identified_predicate option;
ii_ip : Property.identified_property;
}
and identified_type_invariant = {
iti_name : string;
iti_type : Cil_types.typ;
iti_pred : Cil_types.predicate;
iti_loc : Cil_types.location;
}
and identified_global_invariant = {
igi_name : string;
igi_pred : Cil_types.predicate;
igi_loc : Cil_types.location;
}
and identified_other = { io_name : string; io_loc : Property.other_loc; }
and identified_property = private
IPPredicate of Property.identified_predicate
| IPExtended of Property.identified_extended
| IPAxiomatic of Property.identified_axiomatic
| IPLemma of Property.identified_lemma
| IPBehavior of Property.identified_behavior
| IPComplete of Property.identified_complete
| IPDisjoint of Property.identified_disjoint
| IPCodeAnnot of Property.identified_code_annotation
| IPAllocation of Property.identified_allocation
| IPAssigns of Property.identified_assigns
| IPFrom of Property.identified_from
| IPDecrease of Property.identified_decrease
| IPReachable of Property.identified_reachable
| IPPropertyInstance of Property.identified_instance
| IPTypeInvariant of Property.identified_type_invariant
| IPGlobalInvariant of Property.identified_global_invariant
| IPOther of Property.identified_other
type t = identified_property
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 filter_map : (elt -> elt option) -> 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 to_rev_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 filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b 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_rev_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
module Ordered_by_function :
sig
type t = identified_property
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 filter_map : (elt -> elt option) -> 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 to_rev_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 filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b 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_rev_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
end
val short_pretty : Stdlib.Format.formatter -> t -> unit
val pretty_predicate_kind :
Stdlib.Format.formatter -> Property.predicate_kind -> unit
val pretty_debug :
Stdlib.Format.formatter -> Property.identified_property -> unit
val e_loc_of_stmt :
Cil_types.kernel_function -> Cil_types.kinstr -> Property.extended_loc
val o_loc_of_stmt :
Cil_types.kernel_function -> Cil_types.kinstr -> Property.other_loc
val ip_other : string -> Property.other_loc -> Property.identified_property
val ip_reachable_stmt :
Cil_types.kernel_function ->
Cil_types.stmt -> Property.identified_property
val ip_reachable_ppt :
Property.identified_property -> Property.identified_property
val ip_of_requires :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.funbehavior ->
Cil_types.identified_predicate -> Property.identified_property
val ip_requires_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.funbehavior -> Property.identified_property list
val ip_of_assumes :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.funbehavior ->
Cil_types.identified_predicate -> Property.identified_property
val ip_assumes_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.funbehavior -> Property.identified_property list
val ip_of_ensures :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.funbehavior ->
Cil_types.termination_kind * Cil_types.identified_predicate ->
Property.identified_property
val ip_of_extended :
Property.extended_loc ->
Cil_types.acsl_extension -> Property.identified_property
val ip_ensures_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.funbehavior -> Property.identified_property list
val ip_of_allocation :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Property.behavior_or_loop ->
Cil_types.allocation -> Property.identified_property option
val ip_allocation_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funbehavior -> Property.identified_property option
val ip_of_assigns :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Property.behavior_or_loop ->
Cil_types.assigns -> Property.identified_property option
val ip_assigns_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funbehavior -> Property.identified_property option
val ip_of_from :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Property.behavior_or_loop ->
Cil_types.from -> Property.identified_property option
val ip_from_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funbehavior -> Property.identified_property list
val ip_assigns_of_code_annot :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.code_annotation -> Property.identified_property option
val ip_from_of_code_annot :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.code_annotation -> Property.identified_property list
val ip_post_cond_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funbehavior -> Property.identified_property list
val ip_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funbehavior -> Property.identified_property
val ip_all_of_behavior :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funbehavior -> Property.identified_property list
val ip_of_complete :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list -> string list -> Property.identified_property
val ip_complete_of_spec :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funspec -> Property.identified_property list
val ip_of_disjoint :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list -> string list -> Property.identified_property
val ip_disjoint_of_spec :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funspec -> Property.identified_property list
val ip_of_terminates :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.identified_predicate -> Property.identified_property
val ip_terminates_of_spec :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.funspec -> Property.identified_property option
val ip_of_decreases :
Cil_types.kernel_function ->
Cil_types.kinstr -> Cil_types.variant -> Property.identified_property
val ip_decreases_of_spec :
Cil_types.kernel_function ->
Cil_types.kinstr ->
Cil_types.funspec -> Property.identified_property option
val ip_post_cond_of_spec :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funspec -> Property.identified_property list
val ip_of_spec :
Cil_types.kernel_function ->
Cil_types.kinstr ->
active:string list ->
Cil_types.funspec -> Property.identified_property list
val ip_property_instance :
Cil_types.kernel_function ->
Cil_types.stmt ->
Cil_types.identified_predicate option ->
Property.identified_property -> Property.identified_property
val ip_lemma : Property.identified_lemma -> Property.identified_property
val ip_type_invariant :
Property.identified_type_invariant -> Property.identified_property
val ip_global_invariant :
Property.identified_global_invariant -> Property.identified_property
val ip_of_code_annot :
Cil_types.kernel_function ->
Cil_types.stmt ->
Cil_types.code_annotation -> Property.identified_property list
val ip_of_code_annot_single :
Cil_types.kernel_function ->
Cil_types.stmt ->
Cil_types.code_annotation -> Property.identified_property
val ip_of_global_annotation :
Cil_types.global_annotation -> Property.identified_property list
val ip_of_global_annotation_single :
Cil_types.global_annotation -> Property.identified_property option
val has_status : Property.identified_property -> bool
val get_kinstr : Property.identified_property -> Cil_types.kinstr
val get_kf :
Property.identified_property -> Cil_types.kernel_function option
val get_behavior :
Property.identified_property -> Cil_types.funbehavior option
val get_names : Property.identified_property -> string list
val get_for_behaviors : Property.identified_property -> string list
val location : Property.identified_property -> Cil_types.location
val source : Property.identified_property -> Filepath.position option
module LegacyNames :
sig
val self : State.t
val get_prop_basename : Property.identified_property -> string
val get_prop_name_id : Property.identified_property -> string
end
module Names :
sig
val self : State.t
val get_prop_name_id : Property.identified_property -> string
val get_prop_basename :
?truncate:int -> Property.identified_property -> string
end
end