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.0.1.tbz
sha256=dba2b664c7c125687e708e871d83fbfb6ba6d9ee98d235b4850d9a238caa84de
sha512=529987cde39691ad9e955000a3603e89c1c8cf14ed5e8b4cd3a7fc26e47d016aff571b472e2329725133c46f8d0cb45a05b88994eeffaa221a4d31b4c543adcd

doc/goblint.lib/Goblint_lib/FloatDomain/FloatDomTupleImpl/index.html

Module FloatDomain.FloatDomTupleImpl

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 -> 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
include FloatArith with type t := t
val neg : t -> t

Negating a float value: -x

val add : t -> t -> t

Negating a float value: -x

Addition: x + y

val sub : t -> t -> t

Addition: x + y

Subtraction: x - y

val mul : t -> t -> t

Subtraction: x - y

Multiplication: x * y

val div : t -> t -> t

Multiplication: x * y

Division: x / y

val fabs : t -> t

unary functions

fabs(x)

val acos : t -> t

fabs(x)

acos(x)

val asin : t -> t

acos(x)

asin(x)

val atan : t -> t

asin(x)

atan(x)

val cos : t -> t

atan(x)

cos(x)

val sin : t -> t

cos(x)

sin(x)

val tan : t -> t

sin(x)

tan(x)

val lt : t -> t -> IntDomain.IntDomTuple.t

Comparison operators

Less than: x < y

val gt : t -> t -> IntDomain.IntDomTuple.t

Less than: x < y

Greater than: x > y

val le : t -> t -> IntDomain.IntDomTuple.t

Greater than: x > y

Less than or equal: x <= y

val ge : t -> t -> IntDomain.IntDomTuple.t

Less than or equal: x <= y

Greater than or equal: x >= y

val eq : t -> t -> IntDomain.IntDomTuple.t

Greater than or equal: x >= y

Equal to: x == y

val ne : t -> t -> IntDomain.IntDomTuple.t

Equal to: x == y

Not equal to: x != y

val isfinite : t -> IntDomain.IntDomTuple.t

unary functions returning int

__builtin_isfinite(x)

val isinf : t -> IntDomain.IntDomTuple.t

__builtin_isfinite(x)

__builtin_isinf(x)

val isnan : t -> IntDomain.IntDomTuple.t

__builtin_isinf(x)

__builtin_isnan(x)

val isnormal : t -> IntDomain.IntDomTuple.t

__builtin_isnan(x)

__builtin_isnormal(x)

val signbit : t -> IntDomain.IntDomTuple.t

__builtin_isnormal(x)

__builtin_signbit(x)

val to_int : GoblintCil.Cil.ikind -> t -> IntDomain.IntDomTuple.t
val cast_to : GoblintCil.Cil.fkind -> t -> t
val of_const : GoblintCil.Cil.fkind -> float -> t
val of_interval : GoblintCil.Cil.fkind -> (float * float) -> t
val of_string : GoblintCil.Cil.fkind -> string -> t
val of_int : GoblintCil.Cil.fkind -> IntDomain.IntDomTuple.t -> t
val top_of : GoblintCil.Cil.fkind -> t
val bot_of : GoblintCil.Cil.fkind -> t
val ending : GoblintCil.Cil.fkind -> float -> t
val starting : GoblintCil.Cil.fkind -> float -> t
val ending_before : GoblintCil.Cil.fkind -> float -> t
val starting_after : GoblintCil.Cil.fkind -> float -> t
val minimal : t -> float option
val maximal : t -> float option
val is_exact : t -> bool
val get_fkind : t -> GoblintCil.Cil.fkind
val invariant : GoblintCil.Cil.exp -> t -> Invariant.t