Module Wp.Definitions

Generated Logic Definitions

type cluster
val dummy : unit -> cluster
val cluster : id:string -> ?title:string -> ?position:Frama_c_kernel.Filepath.position -> unit -> cluster
val axiomatic : LogicUsage.axiomatic -> cluster
val matrix : unit -> cluster
val cluster_id : cluster -> string

Unique

val cluster_title : cluster -> string
val cluster_position : cluster -> Frama_c_kernel.Filepath.position option
val cluster_age : cluster -> int
val cluster_compare : cluster -> cluster -> int
val pp_cluster : Stdlib.Format.formatter -> cluster -> unit
val iter : (cluster -> unit) -> unit
type dlemma = {
  1. l_name : string;
  2. l_cluster : cluster;
  3. l_kind : Frama_c_kernel.Cil_types.predicate_kind;
  4. l_forall : Lang.F.var list;
  5. l_triggers : trigger list list;
    (*

    OR of AND-triggers

    *)
  6. l_lemma : Lang.F.pred;
}
type definition =
  1. | Logic of Lang.F.tau
  2. | Function of Lang.F.tau * recursion * Lang.F.term
  3. | Predicate of recursion * Lang.F.pred
  4. | Inductive of dlemma list
and recursion =
  1. | Def
  2. | Rec
type dfun = {
  1. d_lfun : Lang.lfun;
  2. d_cluster : cluster;
  3. d_types : int;
  4. d_params : Lang.F.var list;
  5. d_definition : definition;
}
module Trigger : sig ... end
val is_empty : cluster -> bool
val pp_record : Stdlib.Format.formatter -> Frama_c_kernel.Cil_types.compinfo -> unit
val pp_irecord : Stdlib.Format.formatter -> Frama_c_kernel.Cil_types.compinfo -> unit
val pp_typedef : Stdlib.Format.formatter -> Frama_c_kernel.Cil_types.logic_type_info -> unit
val pp_dfun : Stdlib.Format.formatter -> dfun -> unit
val pp_trigger : Stdlib.Format.formatter -> trigger -> unit
val pp_lemma : Stdlib.Format.formatter -> dlemma -> unit
val dump : Stdlib.Format.formatter -> cluster -> unit
val find_symbol : Lang.lfun -> dfun
  • raises Not_found

    if symbol is not compiled (yet)

val define_symbol : dfun -> unit
val update_symbol : dfun -> unit
val find_name : string -> dlemma
val find_lemma : LogicUsage.logic_lemma -> dlemma
  • raises Not_found

    if lemma is not compiled (yet)

val compile_lemma : (LogicUsage.logic_lemma -> dlemma) -> LogicUsage.logic_lemma -> unit
val define_lemma : dlemma -> unit
val call_fun : result:Lang.F.tau -> Lang.lfun -> (Lang.lfun -> dfun) -> Lang.F.term list -> Lang.F.term
val call_pred : Lang.lfun -> (Lang.lfun -> dfun) -> Lang.F.term list -> Lang.F.pred
type axioms = cluster * LogicUsage.logic_lemma list
class virtual visitor : cluster -> object ... end