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.2.1.tbz

sha256=ca24f72fa9a87d288affe97c411753f14b7802bab4ca3649b337276b89bf5674

sha512=394b3521ccda0da91540cebb2f433f7525763060be4bbe179edd3b952a3580a8e173c4e410fc6895dc67fe6d17e6699aeddfed600f4692858bec093dd912bf1e

doc/goblint.lib/Goblint_lib/ValueDomain/Blobs/index.html

Module `ValueDomain.Blobs`

type value = Compound.t

type size = ID.t

type origin = ZeroInit.t

include Lattice.S with type t = value * size * origin

include Lattice.PO with type t = value * size * origin

include Printable.S with type t = value * size * origin

type t = value * size * origin

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

Unique ID, given by HConsed, for context identification in witness

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

widen x y assumes leq x y. Solvers guarantee this by calling widen old (join old new).

val narrow : t -> t -> t

val pretty_diff : unit -> (t * t) -> Goblint_lib__.Lattice.Pretty.doc

If leq x y = false, then pretty_diff () (x, y) should explain why.

val bot : unit -> t

val is_bot : t -> bool

val top : unit -> t

val is_top : t -> bool

val value : t -> value

val invalidate_value : VDQ.t -> GoblintCil.typ -> t -> t