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.domain/MapDomain/GenMapTop/index.html

Module MapDomain.GenMapTopSource

Parameters

module M : MapS with type key = Domain.t
module Range : Lattice.S

Signature

include PS with type key = Domain.t with type value = Range.t
include Printable.S
Sourcetype t
Sourcetype key = Domain.t

The type of the map keys.

Sourcetype value = Range.t

The type of the values.

val add : key -> value -> t -> t
val remove : key -> t -> t
Sourceval find : key -> t -> value
val find_opt : key -> t -> value option
val mem : key -> t -> bool
val iter : (key -> value -> unit) -> t -> unit
val map : (value -> value) -> t -> t
val filter : (key -> value -> bool) -> t -> t
val mapi : (key -> value -> value) -> t -> t
val 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
val for_all : (key -> value -> bool) -> t -> bool
val reflexive_subset_domain_for_all2 : (value -> value -> bool) -> t -> t -> bool
val idempotent_inter : (value -> value -> value) -> t -> t -> t
val nonidempotent_inter : (value -> value -> value) -> t -> t -> t
val idempotent_inter_filter : (value -> value -> value option) -> t -> t -> t
val nonidempotent_inter_filter : (value -> value -> value option) -> t -> t -> t
val idempotent_union : (value -> value -> value) -> t -> t -> t
val nonidempotent_union : (value -> value -> value) -> t -> t -> t
val difference : (value -> value -> value option) -> t -> t -> t
val cardinal : t -> int
val choose : t -> key * value
val singleton : key -> value -> t
Sourceval empty : unit -> t
val is_empty : t -> bool
val exists : (key -> value -> bool) -> t -> bool
val 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
val 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.

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