package goblint

You can search for identifiers within the package.

in-package search v0.2.0

Static analysis framework for C

Install

Dune Dependency

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

Authors

Maintainers

Sources

goblint-2.1.0.tbz

sha256=bfc412ec2e447eaef6f4f83892e3511ebf305593cb00561c1406be3ae8bf48e9

sha512=5f2a162e5f36bffafc9836b0d18b5b2808cecfa6bf68f83bb7d1e8b9947ac74cf07776eb09274b4b29d55c897a45a10768f0d9ed25810cf6ba2409c525e4cd4d

doc/goblint.lib/Goblint_lib/FileDomain/Dom/V/index.html

Module `Dom.V`

type t = D.Value(Val).t

val equal : t -> t -> bool

val hash : t -> int

val compare : t -> t -> int

val show : t -> string

val pretty : unit -> t -> Goblint_lib__Printable.Pretty.doc

val printXml : 'a BatInnerIO.output -> t -> unit

val name : unit -> string

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) -> Goblint_lib__Lattice.Pretty.doc

val bot : unit -> t

val is_bot : t -> bool

val top : unit -> t

val is_top : t -> bool

type k = Lval.CilLval.t

type s = D.Value(Val).s

type r = D.Value(Val).r

val string_of : t -> string

val string_of_key : k -> string

val string_of_record : r -> string

val make : k -> Node.t list -> s -> t

val map : (r -> r) -> t -> t

val filter : (r -> bool) -> t -> t

val union : t -> t -> t

val set_key : k -> t -> t

val set_state : s -> t -> t

val remove_state : s -> t -> t

val split : t -> r Goblint_lib.Prelude.Set.t * r Goblint_lib.Prelude.Set.t

val map' : 
  (r -> 'a) ->
  t ->
  'a Goblint_lib.Prelude.Set.t * 'a Goblint_lib.Prelude.Set.t

val filter' : 
  (r -> bool) ->
  t ->
  r Goblint_lib.Prelude.Set.t * r Goblint_lib.Prelude.Set.t

val length : t -> int * int

val must : (r -> bool) -> t -> bool

val may : (r -> bool) -> t -> bool

val key : r -> k

val loc : r -> Node.t list

val edit_loc : (Node.t list -> Node.t list) -> r -> r

val state : r -> s

val in_state : s -> r -> bool

val get_record : t -> r option

val make_var : k -> t

val from_tuple : 
  (r Goblint_lib.Prelude.Set.t * r Goblint_lib.Prelude.Set.t) ->
  t

val is_alias : t -> bool

val get_alias : t -> k

val make_alias : k -> t