package goblint

  1. Overview
  2. Docs
Static analysis framework for C

Install 

dune-project
 Dependency

goblint.in.tum.de Readme Changelog Edit opam file Versions (9)

Authors

  1. S
    Simmo Saan
  2. M
    Michael Schwarz
  3. J
    Julian Erhard
  4. S
    Sarah Tilscher
  5. R
    Ralf Vogler
  6. K
    Kalmer Apinis
  7. V
    Vesal Vojdani

Maintainers

  1. S
    Simmo Saan <simmo.saan@gmail.com>
  2. M
    Michael Schwarz <michael.schwarz93@gmail.com>

Sources

goblint-2.1.0.tbz
sha256=bfc412ec2e447eaef6f4f83892e3511ebf305593cb00561c1406be3ae8bf48e9
sha512=5f2a162e5f36bffafc9836b0d18b5b2808cecfa6bf68f83bb7d1e8b9947ac74cf07776eb09274b4b29d55c897a45a10768f0d9ed25810cf6ba2409c525e4cd4d

doc/goblint.lib/Goblint_lib/PreValueDomain/AD/index.html

Module PreValueDomain.AD

module Addr : sig ... end
module J : sig ... end
type t
val hash : t -> int
val compare : t -> t -> int
val name : unit -> string
val tag : t -> int
val arbitrary : unit -> t QCheck.arbitrary
val relift : t -> t
val pretty_diff : unit -> (t * t) -> Goblint_lib__Lattice.Pretty.doc
val bot : unit -> t
val is_bot : t -> bool
val top : unit -> t
type elt = Addr.t
val empty : unit -> 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 diff : t -> t -> t
val subset : t -> t -> bool
val disjoint : 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 partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val equal : t -> t -> bool
val widen : t -> t -> t
val join : t -> t -> t
val leq : t -> t -> bool
type field = Addr.field
type idx = IndexDomain.t
type offs = [
  1. | `Field of field * offs
  2. | `Index of idx * offs
  3. | `NoOffset
]
val null_ptr : t
val unknown_ptr : t
val not_null : t
val top_ptr : t
val may_be_unknown : t -> bool
val is_element : Addr.t -> t -> bool
val is_null : t -> bool
val is_not_null : t -> bool
val may_be_null : t -> bool
val to_bool : t -> bool option
val has_unknown : t -> bool
val of_int : (module IntDomain.Z with type t = 'a) -> 'a -> t
val to_int : (module IntDomain.Z with type t = 'a) -> t -> 'a
val get_type : t -> GoblintCil.typ
val from_var : CilType.Varinfo.t -> t
val from_var_offset : (CilType.Varinfo.t * (GoblintCil.fieldinfo, IndexDomain.t) Goblint_lib__Lval.offs) -> t
val to_var_may : t -> CilType.Varinfo.t list
val to_var_must : t -> CilType.Varinfo.t list
val to_var_offset : t -> (CilType.Varinfo.t * (GoblintCil.fieldinfo, IndexDomain.t) Goblint_lib__Lval.offs) list
val is_definite : t -> bool
val from_string : string -> t
val to_string : t -> string list
module ShortAddr : sig ... end
val pretty : unit -> t -> Goblint_lib__SetDomain.Pretty.doc
val show : t -> string
val to_yojson : t -> [> `List of Yojson.Safe.t list ]
val printXml : 'a BatInnerIO.output -> t -> unit
val is_top : t -> bool
val merge : (t -> t -> t) -> (t -> t -> t) -> t -> t -> t
val meet : t -> t -> t
val narrow : t -> t -> t