Module TrieDomain.Make

Parameters

module Key : Printable.S
module Value : Lattice.S

Signature

module Trie : sig ... end
module ChildMap : MapDomain.S with type key = Key.t and type value = Trie.t
include module type of struct include Trie end
type key = Key.t
type value = Value.t
include Lattice.S with type t = value * ChildMap.t
include Lattice.PO with type t = value * ChildMap.t
include Printable.S with type t = value * ChildMap.t
type t = value * ChildMap.t
val equal : t -> t -> bool
val hash : t -> int
val compare : t -> t -> int
val show : t -> string
val pretty : unit -> t -> Goblint_lib__.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) -> Goblint_lib__.Lattice.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