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

sha256=999272bfbd3b9b96fcd58987b237ac6e9fa6d92ef935cc89f1ea2b4205185141

sha512=f3bf6ab71cf8c258d3290da4bf9f6fe42d7c671822e0efeb0fc50afdff078ab15e352237e5c1db31c5aa3a9d430691268ed2e5e00da10f2615835f672f91683d

doc/goblint.lib/ValueDomain/CArrays/index.html

Module `ValueDomain.CArrays`

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 -> Pretty.doc

val printXml : 'a BatInnerIO.output -> t -> unit

val name : unit -> string

val to_yojson : t -> Printable.json

val invariant : Invariant.context -> t -> Invariant.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) -> 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

type idx = ArrIdxDomain.t

The abstract domain used to index on arrays.

type value = Compound.t

The abstract domain of values stored in the array.

val get : Queries.ask -> t -> (ExpDomain.t * idx) -> value

Returns the element residing at the given index.

val set : Queries.ask -> t -> (ExpDomain.t * idx) -> value -> t

Returns a new abstract value, where the given index is replaced with the * given element.

val make : idx -> value -> t

make l e creates an abstract representation of an array of length l * containing the element e.

val length : t -> idx option

returns length of array if known

val move_if_affected : 
  ?replace_with_const:bool ->
  Queries.ask ->
  t ->
  Cil.varinfo ->
  (Cil.exp -> int option) ->
  t

changes the way in which the array is partitioned if this is necessitated by a change * to the variable *

val get_vars_in_e : t -> Cil.varinfo list

returns the variables occuring in the expression according to which the * array was partitioned (if any)

val map : (value -> value) -> t -> t

Apply a function to all elements of the array.

val fold_left : ('a -> value -> 'a) -> 'a -> t -> 'a

Left fold (like List.fold_left) over the arrays elements

val fold_left2 : ('a -> value -> value -> 'a) -> 'a -> t -> t -> 'a

Left fold over the elements of two arrays (like List.fold_left2

val smart_join : 
  (Cil.exp -> int64 option) ->
  (Cil.exp -> int64 option) ->
  t ->
  t ->
  t

val smart_widen : 
  (Cil.exp -> int64 option) ->
  (Cil.exp -> int64 option) ->
  t ->
  t ->
  t

val smart_leq : 
  (Cil.exp -> int64 option) ->
  (Cil.exp -> int64 option) ->
  t ->
  t ->
  bool

val update_length : idx -> t -> t