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

sha256=99b78e6def71534d195eef9084baa26d8334b36084e120aa6afb300c9bf8afa6

sha512=f3162bd95a03c00358a2991f6152fc6169205bfb4c55e2c483e98cc3935673df9656d025b6f1ea0fa5f1bd0aee037d4f483966b0d2907e3fa9bf11a93a3392af

doc/goblint_cdomain_value/ArrayDomain/PartitionedWithLength/argument-1-Val/index.html

Parameter `PartitionedWithLength.Val`

include LatticeWithInvalidate

include Lattice.S

include Lattice.PO

include Printable.S

type t

val equal : t -> t -> bool

val hash : t -> int

val compare : t -> t -> int

val show : t -> string

val pretty : unit -> t -> 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) -> 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 invalidate_abstract_value : t -> t

val smart_join : 
  (GoblintCil.Cil.exp -> IntOps.BigIntOps.t option) ->
  (GoblintCil.Cil.exp -> IntOps.BigIntOps.t option) ->
  t ->
  t ->
  t

val smart_widen : 
  (GoblintCil.Cil.exp -> IntOps.BigIntOps.t option) ->
  (GoblintCil.Cil.exp -> IntOps.BigIntOps.t option) ->
  t ->
  t ->
  t

val smart_leq : 
  (GoblintCil.Cil.exp -> IntOps.BigIntOps.t option) ->
  (GoblintCil.Cil.exp -> IntOps.BigIntOps.t option) ->
  t ->
  t ->
  bool