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. V
    Vesal Vojdani
  2. K
    Kalmer Apinis
  3. R
    Ralf Vogler
  4. M
    Michael Schwarz
  5. J
    Julian Erhard
  6. S
    Simmo Saan

Maintainers

  1. M
    Michael Schwarz <michael.schwarz93@gmail.com>
  2. S
    Simmo Saan <simmo.saan@gmail.com>
  3. R
    Ralf Vogler <ralf.vogler@gmail.com>

Sources

goblint-1.1.1.tbz
sha256=999272bfbd3b9b96fcd58987b237ac6e9fa6d92ef935cc89f1ea2b4205185141
sha512=f3bf6ab71cf8c258d3290da4bf9f6fe42d7c671822e0efeb0fc50afdff078ab15e352237e5c1db31c5aa3a9d430691268ed2e5e00da10f2615835f672f91683d

doc/goblint.lib/PartitionDomain/SetSet/index.html

Module PartitionDomain.SetSet

Parameters

module Base : Printable.S

Signature

module B : sig ... end
module E : sig ... end
include module type of struct include E end
type t = [
  1. | `Lifted of SetDomain.Make(B).t
  2. | `Top
]
val equal : t -> t -> bool
val hash : t -> int
val compare : t -> t -> int
val pretty : unit -> t -> Pretty.doc
val name : unit -> string
val to_yojson : t -> Printable.json
val invariant : Invariant.context -> t -> Invariant.t
val tag : t -> int
val arbitrary : unit -> t QCheck.arbitrary
val relift : t -> t
val pretty_diff : unit -> (t * t) -> Pretty.doc
type elt = B.t
val empty : unit -> t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val of_list : elt list -> t
val min_elt : t -> elt
val max_elt : t -> elt
val choose : t -> elt
val split : elt -> t -> t * bool * t
type set = B.t
type partition = t
val show : 'a -> string
val top : unit -> E.t
val bot : unit -> E.t
val is_top : E.t -> bool
val is_bot : E.t -> bool
val leq : E.t -> E.t -> bool
val meet : E.t -> E.t -> E.t
val join : E.t -> E.t -> E.t
val remove : B.elt -> E.t -> E.t
val add_eq : (B.elt * B.elt) -> E.t -> E.t
val filter : (B.elt -> bool) -> E.t -> E.t
val find_class : Base.t -> t -> set option
val widen : E.t -> E.t -> E.t
val narrow : E.t -> E.t -> E.t
val printXml : 'a BatInnerIO.output -> t -> unit