package goblint

  1. Overview
  2. Docs
Static analysis framework for C

Install 

dune-project
 Dependency

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

Authors

  1. S
    Simmo Saan
  2. M
    Michael Schwarz
  3. J
    Julian Erhard
  4. S
    Sarah Tilscher
  5. K
    Karoliine Holter
  6. M
    Michael Petter
  7. A
    Ali Rasim Kocal
  8. R
    Ralf Vogler
  9. K
    Kalmer Apinis
  10. V
    Vesal Vojdani

Maintainers

  1. S
    Simmo Saan <simmo.saan@gmail.com>
  2. M
    Michael Schwarz <michael.schwarz93@gmail.com>
  3. K
    Karoliine Holter <karoliine.holter@ut.ee>

Sources

goblint-2.8.0.tbz
sha256=9175eec0143102243964e34a0786584fd590c60422009259c705a89a27f88de4
sha512=9d760007dd8d003cf596516444ed7acc7370fc3d446e75ac71b0176522c3baae090410762f9035e7aae4f6b0e394bf28bb5b1c08ca0476920b94aa919ef04f42

doc/goblint_cdomain_value/FloatDomain/F32Interval/index.html

Module FloatDomain.F32Interval

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.

include Lattice.Bot with type t := t
val bot : unit -> t
val is_bot : t -> bool
include Lattice.Top with type t := t
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

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 fmax : t -> t -> t

Maximum

val fmin : t -> t -> t

Minimum

Unary functions

val ceil : t -> t

ceil(x)

val floor : t -> t

floor(x)

val fabs : t -> t

fabs(x)

val acos : t -> t

acos(x)

val asin : t -> t

asin(x)

val atan : t -> t

atan(x)

val cos : t -> t

cos(x)

val sin : t -> t

sin(x)

val tan : t -> t

tan(x)

val sqrt : t -> t

sqrt(x)

val inv_ceil : ?asPreciseAsConcrete:bool -> t -> t

nversions of unary functions

(inv_ceil z -> x) if (z = ceil(x))

val inv_floor : ?asPreciseAsConcrete:bool -> t -> t

(inv_ceil z -> x) if (z = ceil(x))

(inv_floor z -> x) if (z = floor(x))

val inv_fabs : t -> t

(inv_floor z -> x) if (z = floor(x))

(inv_fabs z -> x) if (z = fabs(x))

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

val unordered : t -> t -> bool option

Unordered

Unary functions returning int

val isfinite : t -> bool option

__builtin_isfinite(x)

val isinf : t -> bool option

__builtin_isinf(x)

val isnan : t -> bool option

__builtin_isnan(x)

val isnormal : t -> bool option

__builtin_isnormal(x)

val signbit : t -> bool option

__builtin_signbit(x)

val to_int : GoblintCil.Cil.ikind -> t -> IntDomain.IntDomTuple.t
val nan : unit -> t
val of_const : float -> t
val of_interval : (float * float) -> t
val of_string : string -> t
val of_int : IntDomain.IntDomTuple.t -> t
val ending : float -> t
val starting : float -> t
val ending_before : float -> t
val starting_after : float -> t
val finite : t
val minimal : t -> float option
val maximal : t -> float option
val is_exact : t -> bool