package goblint

You can search for identifiers within the package.

in-package search v0.2.0

Static analysis framework for C

Install

dune-project

Dependency

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

Authors

Maintainers

Sources

goblint-2.8.0.tbz

sha256=9175eec0143102243964e34a0786584fd590c60422009259c705a89a27f88de4

sha512=9d760007dd8d003cf596516444ed7acc7370fc3d446e75ac71b0176522c3baae090410762f9035e7aae4f6b0e394bf28bb5b1c08ca0476920b94aa919ef04f42

doc/goblint_cdomain_value/ArrayDomain/PartitionedWithLength/argument-2-Idx/index.html

Parameter `PartitionedWithLength.Idx`

include IntDomain_intf.B with type int_t = Z.t

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.

include Lattice.Bot with type t := t

val bot : unit -> t

val is_bot : t -> bool

type int_t = Z.t

Accessing values of the ADT

val bot_of : GoblintCil.Cil.ikind -> t

val top_of : ?bitfield:int -> GoblintCil.Cil.ikind -> t

val to_int : t -> int_t option

Return a single integer value if the value is a known constant, otherwise * don't return anything.

val equal_to : int_t -> t -> [ `Eq | `Neq | `Top ]

val to_bool : t -> bool option

Give a boolean interpretation of an abstract value if possible, otherwise * don't return anything.

val to_excl_list : t -> (int_t list * (int * int)) option

Gives a list representation of the excluded values from included range of bits if possible.

val of_excl_list : GoblintCil.Cil.ikind -> int_t list -> t

Creates an exclusion set from a given list of integers.

val is_excl_list : t -> bool

Checks if the element is an exclusion set.

val to_incl_list : t -> int_t list option

Gives a list representation of the included values if possible.

val maximal : t -> int_t option

val minimal : t -> int_t option

Cast

val cast_to : 
  ?suppress_ovwarn:bool ->
  kind:GoblintCil.castkind ->
  GoblintCil.Cil.ikind ->
  t ->
  t

Cast to Cil.ikind. The function is also called to handle overflow/wraparound after operations.

include Lattice.Top with type t := t

val top : unit -> t

val is_top : t -> bool

include IntDomain_intf.Arith with type t := t

val neg : t -> t

Negating an integer value: -x

val add : t -> t -> t

Addition: x + y

val sub : t -> t -> t

Subtraction: x - y

val mul : t -> t -> t

Multiplication: x * y

val div : t -> t -> t

Division: x / y

val rem : t -> t -> t

Integer remainder: x % y

Comparison operators

val lt : t -> t -> bool option

Less than: x < y

val gt : t -> t -> bool option

Greater than: x > y

val le : t -> t -> bool option

Less than or equal: x <= y

val ge : t -> t -> bool option

Greater than or equal: x >= y

val eq : t -> t -> bool option

Equal to: x == y

val ne : t -> t -> bool option

Not equal to: x != y

Bitwise logical operators

val lognot : t -> t

Bitwise logical not (one's complement): ~x

val logand : t -> t -> t

Bitwise logical and: x & y

val logor : t -> t -> t

Bitwise logical or: x | y

val logxor : t -> t -> t

Bitwise logical exclusive or: x ^ y

val shift_left : t -> t -> t

Shifting bits left: x << y

val shift_right : t -> t -> t

Shifting bits right: x >> y

val of_int : ?suppress_ovwarn:bool -> GoblintCil.Cil.ikind -> int_t -> t

Transform an integer literal to your internal domain representation with the specified ikind.

val of_bool : GoblintCil.Cil.ikind -> bool -> t

Transform a known boolean value to the default internal representation of the specified ikind. It * should follow C: of_bool true = of_int 1 and of_bool false = of_int 0.

val of_interval : 
  ?suppress_ovwarn:bool ->
  GoblintCil.Cil.ikind ->
  (int_t * int_t) ->
  t

val of_congruence : GoblintCil.Cil.ikind -> (int_t * int_t) -> t

val of_bitfield : GoblintCil.Cil.ikind -> (int_t * int_t) -> t

val to_bitfield : GoblintCil.Cil.ikind -> t -> int_t * int_t

val starting : ?suppress_ovwarn:bool -> GoblintCil.Cil.ikind -> int_t -> t

val ending : ?suppress_ovwarn:bool -> GoblintCil.Cil.ikind -> int_t -> t

val is_top_of : GoblintCil.Cil.ikind -> t -> bool

val project : PrecisionUtil.int_precision -> t -> t

val invariant : GoblintCil.Cil.exp -> t -> Invariant.t