package goblint
Build not yet checkedInstall
dune-project
Dependency
Authors
Maintainers
Sources
sha256=882f25e68cc14d42879ab4775fb2cf99aaac7e3cc70d58fa632b7edef304a731
sha512=dc90f0a685709688bbc13c80d0e2b01bf87cf2bbdc7f0c22632227ae32bee9377f3f1cb50f00cf564d6f1313c27fba5d811c53bb17a24972ab5aa570bf62278b
doc/goblint_cdomain_value/ArrayDomain/TrivialWithLength/index.html
Module ArrayDomain.TrivialWithLength
This functor creates a trivial single cell representation of an array. The * indexing type is also used to manage the length.
Parameters
module Val : LatticeWithInvalidateSignature
include S0 with type value = Val.t
include Lattice.S
include Lattice.PO
include Printable.S
val hash : t -> intval show : t -> stringval pretty : unit -> t -> Printable.Pretty.docval printXml : 'a BatInnerIO.output -> t -> unitval to_yojson : t -> Yojson.Safe.tval tag : t -> intUnique ID, given by HConsed, for context identification in witness
val arbitrary : unit -> t QCheck.arbitrarytype idx = PreValueDomain.IndexDomain.tThe abstract domain used to index on arrays.
type value = Val.tThe abstract domain of values stored in the array.
Returns a new abstract value, where the given index is replaced with the * given element.
val make :
?varAttr:GoblintCil.Cil.attributes ->
?typAttr:GoblintCil.Cil.attributes ->
SizeDomain.t ->
value ->
tmake l e creates an abstract representation of an array of length l * containing the element e.
val length : t -> SizeDomain.t optionreturns length of array if known
val update_length : SizeDomain.t -> t -> tval get :
?checkBounds:bool ->
VDQ.t ->
t ->
(Basetype.CilExp.t option * idx) ->
valueReturns the element residing at the given index.
val move_if_affected :
?replace_with_const:bool ->
VDQ.t ->
t ->
GoblintCil.Cil.varinfo ->
(GoblintCil.Cil.exp -> int option) ->
tchanges the way in which the array is partitioned if this is necessitated by a change * to the variable *
val get_vars_in_e : t -> GoblintCil.Cil.varinfo listreturns the variables occuring in the expression according to which the * array was partitioned (if any)
Left fold (like List.fold_left) over the arrays elements
val invariant :
value_invariant:
(offset:GoblintCil.Cil.offset ->
lval:GoblintCil.Cil.lval ->
value ->
Invariant.t) ->
offset:GoblintCil.Cil.offset ->
lval:GoblintCil.Cil.lval ->
t ->
Invariant.t