package mopsa

  1. Overview
  2. Docs
MOPSA: A Modular and Open Platform for Static Analysis using Abstract Interpretation

Install 

dune-project
 Dependency

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

Authors

  1. A
    Antoine Miné
  2. A
    Abdelraouf Ouadjaout
  3. M
    Matthieu Journault
  4. A
    Aymeric Fromherz
  5. R
    Raphaël Monat
  6. F
    Francesco Parolini
  7. M
    Marco Milanese
  8. J
    Jérôme Boillot

Maintainers

  1. A
    Antoine Miné <antoine.mine@lip6.fr>
  2. A
    Abdelraouf Ouadjaout <ouadjaout@gmail.com>
  3. R
    Raphaël Monat <raphael.monat@inria.fr>

Sources

mopsa-analyzer-v1.2.tar.gz
md5=37966e98ffeebcedc09bd6e9b2b81f69
sha512=40d4d826c25f680766c07eccbabdf5e8a4fa023016e8a164e4e4f6b3781c8484dc4df437055721dfd19b9db8fb7fe3b61236c4833186d346fc7204a68d01eaaa

doc/mopsa.mopsa_utils/Mopsa_utils/Containers/Equiv/Make/index.html

Module Equiv.Make

Parameters

module L : OrderedType
module R : OrderedType

Signature

exception Already_Paired
module LR : sig ... end
module RL : sig ... end
type t = {
  1. lr : R.t LR.t;
  2. rl : L.t RL.t;
}
val compare : t -> t -> int
val empty : t
val fold_lr : ((L.t * R.t) -> 'a -> 'a) -> t -> 'a -> 'a
val fold_rl : ((L.t * R.t) -> 'a -> 'a) -> t -> 'a -> 'a
val fold : ((L.t * R.t) -> 'a -> 'a) -> t -> 'a -> 'a
val print : Format.formatter -> t -> unit
val mem_l : L.t -> t -> bool
val mem_r : R.t -> t -> bool
val find_l : LR.key -> t -> R.t
val find_r : RL.key -> t -> L.t
val check_consistency : t -> t
val iter : ((L.t * R.t) -> unit) -> t -> unit
val remove_l : L.t -> t -> t
val remove_r : R.t -> t -> t
val add : (L.t * R.t) -> t -> t
val mem : (L.t * R.t) -> t -> bool
val concat : t -> t -> t
val find_l_opt : L.t -> t -> R.t option
val find_r_opt : R.t -> t -> L.t option
val map : ((L.t * R.t) -> L.t * R.t) -> t -> t
val filter : ((L.t * R.t) -> bool) -> t -> t
val exists : ((L.t * R.t) -> bool) -> t -> bool
val forall : ((L.t * R.t) -> bool) -> t -> bool