package goblint

You can search for identifiers within the package.

in-package search v0.2.0

Static analysis framework for C

Install

Dune Dependency

goblint.in.tum.de Readme Changelog Edit opam file Versions (8)

Authors

Maintainers

Sources

goblint-2.3.0.tbz

sha256=b729c94adb383a39aea32eb005c988dfd44b92af22ee6a4eedf4239542ac6c26

sha512=643b98770e5fe5644324c95c9ae3a9f698f25c8b11b298f0751d524e0b20af368b2a465fc8200b75a73d48fc9a053fd90f5e8920d4db070927f93188bb8687e0

doc/goblint.lib/Goblint_lib/Base/MainFunctor/Dom/index.html

Module `MainFunctor.Dom`

type t

val equal : t -> t -> bool

val hash : t -> int

val compare : t -> t -> int

val show : t -> string

val pretty : unit -> t -> 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

val arbitrary : unit -> t QCheck.arbitrary

val relift : t -> t

val meet : t -> t -> t

val narrow : t -> t -> t

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

val bot : unit -> t

val is_bot : t -> bool

val top : unit -> t

val is_top : t -> bool

val op_scheme : 
  (Goblint_lib__MapDomain.LiftTop(ValueDomain.Compound)(MapDomain.HashCached(Goblint_lib__BaseDomain.CPA.M)).t ->
    Goblint_lib__MapDomain.LiftTop(ValueDomain.Compound)(MapDomain.HashCached(Goblint_lib__BaseDomain.CPA.M)).t ->
    Goblint_lib__MapDomain.LiftTop(ValueDomain.Compound)(MapDomain.HashCached(Goblint_lib__BaseDomain.CPA.M)).t) ->
  (Goblint_lib__MapDomain.MapBot_LiftTop(Basetype.Variables)(Goblint_lib__BaseDomain.PartDeps.VarSet).t ->
    Goblint_lib__MapDomain.MapBot_LiftTop(Basetype.Variables)(Goblint_lib__BaseDomain.PartDeps.VarSet).t ->
    Goblint_lib__MapDomain.MapBot_LiftTop(Basetype.Variables)(Goblint_lib__BaseDomain.PartDeps.VarSet).t) ->
  ([ `Lifted of BatSet.Make(Basetype.Variables).t | `Top ] ->
    [ `Lifted of BatSet.Make(Basetype.Variables).t | `Top ] ->
    [ `Lifted of BatSet.Make(Basetype.Variables).t | `Top ]) ->
  (Priv.D.t -> Priv.D.t -> Priv.D.t) ->
  t ->
  t ->
  t

val join : t -> t -> t

val leq : RVEval.t -> RVEval.t -> bool

val widen : RVEval.t -> RVEval.t -> t