package goblint

  1. Overview
  2. Docs
Static analysis framework for C

Install 

dune-project
 Dependency

goblint.in.tum.de Edit opam file Versions (11)

Authors

  1. S
    Simmo Saan
  2. M
    Michael Schwarz
  3. J
    Julian Erhard
  4. S
    Sarah Tilscher
  5. K
    Karoliine Holter
  6. M
    Michael Petter
  7. A
    Ali Rasim Kocal
  8. R
    Ralf Vogler
  9. K
    Kalmer Apinis
  10. V
    Vesal Vojdani

Maintainers

  1. S
    Simmo Saan <simmo.saan@gmail.com>
  2. M
    Michael Schwarz <michael.schwarz93@gmail.com>
  3. K
    Karoliine Holter <karoliine.holter@ut.ee>

Sources

goblint-2.8.0.tbz
sha256=9175eec0143102243964e34a0786584fd590c60422009259c705a89a27f88de4
sha512=9d760007dd8d003cf596516444ed7acc7370fc3d446e75ac71b0176522c3baae090410762f9035e7aae4f6b0e394bf28bb5b1c08ca0476920b94aa919ef04f42

doc/goblint.lib/Goblint_lib/MusteqDomain/Equ/index.html

Module MusteqDomain.Equ

include sig ... end
type key = P.t
type value = F.t
val remove : key -> t -> t
val find : key -> t -> value
val find_opt : key -> t -> value option
val mem : key -> t -> bool
val iter : (key -> value -> unit) -> t -> unit
val map : (value -> value) -> t -> t
val filter : (key -> value -> bool) -> t -> t
val mapi : (key -> value -> value) -> t -> t
val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
val add_list : (key * value) list -> t -> t
val add_list_set : key list -> value -> t -> t
val add_list_fun : key list -> (key -> value) -> t -> t
val for_all : (key -> value -> bool) -> t -> bool
val reflexive_subset_domain_for_all2 : (value -> value -> bool) -> t -> t -> bool
val idempotent_inter : (value -> value -> value) -> t -> t -> t
val nonidempotent_inter : (value -> value -> value) -> t -> t -> t
val idempotent_inter_filter : (value -> value -> value option) -> t -> t -> t
val nonidempotent_inter_filter : (value -> value -> value option) -> t -> t -> t
val idempotent_union : (value -> value -> value) -> t -> t -> t
val nonidempotent_union : (value -> value -> value) -> t -> t -> t
val difference : (value -> value -> value option) -> t -> t -> t
val cardinal : t -> int
val choose : t -> key * value
val singleton : key -> value -> t
val empty : unit -> t
val is_empty : t -> bool
val exists : (key -> value -> bool) -> t -> bool
val bindings : t -> (key * value) list
val equal : t -> t -> bool
val hash : t -> int
val compare : t -> t -> int
val printXml : 'a BatInnerIO.output -> t -> unit
val to_yojson : t -> Yojson.Safe.t
val tag : t -> int
val arbitrary : unit -> t QCheck.arbitrary
val relift : t -> t
val leq : t -> t -> bool
val join : t -> t -> t
val meet : t -> t -> t
val widen : t -> t -> t
val narrow : t -> t -> t
val pretty_diff : unit -> (t * t) -> Lattice.Pretty.doc
val bot : unit -> t
val is_bot : t -> bool
val top : unit -> t
val is_top : t -> bool
val widen_with_fct : (value -> value -> value) -> t -> t -> t
val join_with_fct : (value -> value -> value) -> t -> t -> t
val leq_with_fct : (value -> value -> bool) -> t -> t -> bool
val name : unit -> string
val show : 'a -> string
val pretty : unit -> t -> GoblintCil.Pretty.doc
val add_old : key -> value -> t -> t
val add : (V.t * V.t) -> F.t -> t -> t
val kill : V.t -> t -> t
val kill_vars : V.t list -> t -> t
val other_addrs : (GoblintCil.varinfo * VF.idx Offset.t) -> t -> VF.t list
val eval_rv : GoblintCil.exp -> VF.t option
val add_eq : (V.t * V.t) -> t -> t