package mopsa

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

Install 

dune-project
 Dependency

gitlab.com 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.0.tar.gz
md5=9f673f79708b44a7effb3b6bb3618d2c
sha512=cb91cb428e43a22f1abbcb8219710d0c10a5b3756d0da392d4084b3b3a6157350776c596983e63def344f617d39964e91f244f60c07958695ee5c8c809a9f0f4

doc/lattices/Lattices/Partial_inversible_map/Make/index.html

Module Partial_inversible_map.MakeSource

Parameters

module Key : ORDER
module Value : ORDER

Signature

Set of keys

Set of values

Sourcetype t

Type of inversible maps

Sourceval bottom : t

⊥ element

Sourceval top : t

⊤ element

Sourceval is_bottom : t -> bool

is_bottom a checks whether a is ⊥

Sourceval print : Core.All.Print.printer -> t -> unit

Pretty printer.

Sourceval empty : t

Singleton of empty map

Sourceval subset : t -> t -> bool

Inclusion test.

Sourceval join : t -> t -> t

Join two sets of partial maps.

Sourceval meet : t -> t -> t

Intersect to sets of partial maps.

Sourceval widen : 'a Core.All.ctx -> t -> t -> t

Widening operator

find k a find the set of values attached to key k in a. Raise Not_found of the key is not found.

find_inverse finds the set of keys attached to value v in a.

Sourceval remove : Key.t -> t -> t

remove k a removes all bindings (k,-) in a

Sourceval remove_inverse : Value.t -> t -> t

remove_inverse v a remove all bindings (-,v) in a

Sourceval filter : (Key.t -> ValueSet.t Mopsa_utils.Top.with_top -> bool) -> t -> t

filter f a keeps all bindings (k,vs) in a such that f k vs is true

Sourceval filter_inverse : (Value.t -> KeySet.t -> bool) -> t -> t

filter_inverse f a keeps all inverse bindings (v,ks) in a such that f v ks is true

set k vs a adds the binding (k,vs) to a. Previous bindings are overwritten.

Sourceval add_inverse : Value.t -> KeySet.t -> t -> t

add_inverse v ks a adds the binding (k,{v} ∪ find k a) to a, where k ∈ ks.

Sourceval rename : Key.t -> Key.t -> t -> t

rename k k' a renames key k to k' in a

Sourceval rename_inverse : Value.t -> Value.t -> t -> t

rename k k' a renames value v to v' in a

Sourceval singleton : Key.t -> Value.t -> t

singleton k v createw a map with the singleton binding (k,{v})

Sourceval mem : Key.t -> t -> bool

mem k a check whether a binding (k,-) exists in a

Sourceval mem_inverse : Value.t -> t -> bool

mem v a check whether a binding (_,v) exists in a

Sourceval fold : (Key.t -> ValueSet.t Mopsa_utils.Top.with_top -> 'a -> 'a) -> t -> 'a -> 'a

fold f a init folds function f over elements (k,vs) in a

map f a replace bindings (k,vs) in a with (k,f vs)