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 (10)

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.7.1.tbz
sha256=af01aac256229f33a90a9fcbfed04b01e3097f154d4d124f006476d6387c6a66
sha512=2a93bfe16881adbc2d8dcbfe38c1e19cd24ca105d8e1eda13d02440f3002874ffe2957dfd937510765233a054a40568b0052db92e31d382a5bd215d1ec12565c

doc/goblint_cdomain_value/NullByteSet/MustMaySet/index.html

Module NullByteSet.MustMaySet

include sig ... end
type t = MustSet.t * MaySet.t
val is_top : t -> bool
val top : unit -> t
val is_bot : t -> bool
val bot : unit -> t
val narrow : t -> t -> t
val widen : t -> t -> t
val meet : t -> t -> t
val join : t -> t -> t
val leq : t -> t -> bool
val expand_fst : bool
val expand_snd : bool
val equal : t -> t -> Ppx_deriving_runtime.bool
val compare : t -> t -> Ppx_deriving_runtime.int
val hash : t -> int
val relift : t -> t
val tag : 'a -> 'b
val show : (MustSet.t * MaySet.t) -> string
val name : unit -> string
val pretty : unit -> (MustSet.t * MaySet.t) -> Printable.Pretty.doc
val printXml : 'a BatInnerIO.output -> (MustSet.t * MaySet.t) -> unit
val to_yojson : (MustSet.t * MaySet.t) -> [> `Assoc of (string * Yojson.Safe.t) list ]
val arbitrary : unit -> (MustSet.t * MaySet.t) QCheck.arbitrary
val pretty_diff : unit -> (t * t) -> Lattice.Pretty.doc
module Set : sig ... end
type mode =
  1. | Definitely
  2. | Possibly
val empty : unit -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val full_set : unit -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val is_empty : mode -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) -> bool
val min_elem : mode -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.M.t) -> MustSet.M.elt
val min_elem_precise : ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.M.t) -> bool
val mem : mode -> MustSet.elt -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) -> bool
val interval_mem : mode -> (MustSet.M.elt * Z.t) -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a) -> bool
val remove : mode -> MustSet.M.elt -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.M.t) -> Z.t -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.M.t
val add : mode -> MustSet.elt -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val add_list : mode -> MaySet.elt list -> ('a * MaySet.t) -> 'a * MaySet.t
val add_interval : ?maxfull:Z.t option -> mode -> (MaySet.elt * Z.t) -> (MaySet.t * MaySet.t) -> MaySet.t * MaySet.t
val remove_interval : mode -> (Z.t * Z.t) -> Z.t -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a) -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a
val add_all : mode -> ('a * 'b) -> 'a * MaySet.t
val remove_all : mode -> ('a * MaySet.t) -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val is_full_set : mode -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) -> bool
val get_set : mode -> ('a * 'a) -> 'a
val elements : ?max_size:Z.t -> ?min_size:'a -> mode -> ('b * MaySet.M.t) -> MaySet.M.elt list
val union_mays : ('a * MaySet.t) -> ('b * MaySet.t) -> 'a * MaySet.t
val precise_singleton : MustSet.elt -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val precise_set : Set.t -> t
val make_all_must : unit -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t
val may_can_benefit_from_filter : ('a * MaySet.t) -> bool
val exists : mode -> (MaySet.elt -> bool) -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * MaySet.t) -> bool
val filter : ?min_size:Z.t -> ?max_size:Z.t -> (MaySet.M.elt -> bool) -> (MustSet.t * MaySet.M.t) -> t
val filter_musts : (MustSet.M.elt -> bool) -> Z.t -> ([ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a) -> [ `Lifted of SetDomain.Make(IntOps.BigIntOps).t | `Top ] * 'a