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. K
    Karoliine Holter
  6. R
    Ralf Vogler
  7. K
    Kalmer Apinis
  8. 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.5.0.tbz
sha256=452d8491527aea21f2cbb11defcc14ba0daf9fdb6bdb9fc0af73e56eac57b916
sha512=1993cd45c4c7fe124ca6e157f07d17ec50fab5611b270a434ed1b7fb2910aa85a8e6eaaa77dad770430710aafb2f6d676c774dd33942d921f23e2f9854486551

doc/goblint.domain/DisjointDomain/PairwiseMap/index.html

Module DisjointDomain.PairwiseMapSource

Map of keys E.t grouped into buckets by C, where each bucket is described by the map B with values R.t.

Common choice for B is MapDomain.Joined.

Handles Lattice.BotValue from B.

Parameters

module E : Printable.S
module R : Printable.S
module B : MapDomain.S with type key = E.t and type value = R.t
module C : Congruence with type elt = E.t

Signature

include MapDomain.PS with type key = E.t with type value = B.value
include Printable.S
Sourcetype t
Sourcetype key = E.t

The type of the map keys.

Sourcetype value = B.value

The type of the values.

Sourceval add : key -> value -> t -> t
Sourceval remove : key -> t -> t
Sourceval find : key -> t -> value
Sourceval find_opt : key -> t -> value option
Sourceval mem : key -> t -> bool
Sourceval iter : (key -> value -> unit) -> t -> unit
Sourceval map : (value -> value) -> t -> t
Sourceval filter : (key -> value -> bool) -> t -> t
Sourceval mapi : (key -> value -> value) -> t -> t
Sourceval fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval add_list : (key * value) list -> t -> t
Sourceval add_list_set : key list -> value -> t -> t
Sourceval add_list_fun : key list -> (key -> value) -> t -> t
Sourceval for_all : (key -> value -> bool) -> t -> bool
Sourceval map2 : (value -> value -> value) -> t -> t -> t
Sourceval long_map2 : (value -> value -> value) -> t -> t -> t
Sourceval merge : (key -> value option -> value option -> value option) -> t -> t -> t
Sourceval cardinal : t -> int
Sourceval choose : t -> key * value
Sourceval singleton : key -> value -> t
Sourceval empty : unit -> t
Sourceval is_empty : t -> bool
Sourceval exists : (key -> value -> bool) -> t -> bool
Sourceval bindings : t -> (key * value) list
include Lattice.S with type t := t
include Lattice.PO with type t := t
include Printable.S with type t := t
Sourceval equal : t -> t -> bool
Sourceval hash : t -> int
Sourceval compare : t -> t -> int
Sourceval show : t -> string
Sourceval pretty : unit -> t -> Printable.Pretty.doc
Sourceval printXml : 'a BatInnerIO.output -> t -> unit
Sourceval name : unit -> string
Sourceval to_yojson : t -> Yojson.Safe.t
Sourceval tag : t -> int

Unique ID, given by HConsed, for context identification in witness

Sourceval arbitrary : unit -> t QCheck.arbitrary
Sourceval relift : t -> t
Sourceval leq : t -> t -> bool
Sourceval join : t -> t -> t
Sourceval meet : t -> t -> t
Sourceval widen : t -> t -> t

widen x y assumes leq x y. Solvers guarantee this by calling widen old (join old new).

Sourceval narrow : t -> t -> t
Sourceval pretty_diff : unit -> (t * t) -> Lattice.Pretty.doc

If leq x y = false, then pretty_diff () (x, y) should explain why.

Sourceval bot : unit -> t
Sourceval is_bot : t -> bool
Sourceval top : unit -> t
Sourceval is_top : t -> bool
Sourceval widen_with_fct : (value -> value -> value) -> t -> t -> t
Sourceval join_with_fct : (value -> value -> value) -> t -> t -> t
Sourceval leq_with_fct : (value -> value -> bool) -> t -> t -> bool