package mopsa

You can search for identifiers within the package.

in-package search v0.2.0

MOPSA: A Modular and Open Platform for Static Analysis using Abstract Interpretation

Install

Dune Dependency

mopsa.lip6.fr Readme Changelog Edit opam file Versions (2)

Authors

Maintainers

Sources

mopsa-analyzer-v1.1.tar.gz

md5=fdee20e988343751de440b4f6b67c0f4

sha512=f5cbf1328785d3f5ce40155dada2d95e5de5cce4f084ea30cfb04d1ab10cc9403a26cfb3fa55d0f9da72244482130fdb89c286a9aed0d640bba46b7c00e09500

doc/powersets/Powersets/Standard/Value/Powerset/index.html

Module `Value.Powerset`

module Set : sig ... end

type t = Set.t Mopsa_utils.Top.with_top

val bottom : t

val top : t

val is_top : t -> bool

val subset : t -> t -> bool

val equal : t -> t -> bool

val compare : t -> t -> int

val join : t -> t -> t

val meet : t -> t -> t

val union : t -> t -> t

val inter : t -> t -> t

val diff : t -> t -> t

val widen : 'a Core.Context.ctx -> t -> t -> t

val print : Core.Print.printer -> t -> unit

val add : Set.elt -> t -> t

val fold : (Z.t -> 'a -> 'a) -> t -> 'a -> 'a

val remove : Z.t -> t -> t

val mem : Z.t -> t -> bool

val filter : (Set.elt -> bool) -> t -> t

val partition : (Set.elt -> bool) -> t -> t * t

val exists : (Set.elt -> bool) -> t -> bool

val for_all : (Set.elt -> bool) -> t -> bool

val cardinal : t -> int

val find : Set.elt -> t -> Z.t

val choose : t -> Z.t

val singleton : Z.t -> t

val of_list : Z.t list -> Set.t Mopsa_utils.Top.with_top

val is_empty : t -> bool

val empty : t

val is_bottom : t -> bool

val is_singleton : t -> bool

val elements : t -> Set.elt list

val map : (Z.t -> Z.t) -> t -> t

val iter : (Z.t -> unit) -> t -> unit

val apply : (Set.t -> 'a) -> 'a -> t -> 'a