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-project

Dependency

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

Authors

Maintainers

Sources

mopsa-analyzer-v1.2.tar.gz

md5=37966e98ffeebcedc09bd6e9b2b81f69

sha512=40d4d826c25f680766c07eccbabdf5e8a4fa023016e8a164e4e4f6b3781c8484dc4df437055721dfd19b9db8fb7fe3b61236c4833186d346fc7204a68d01eaaa

doc/mopsa.mopsa_analyzer/Mopsa_analyzer/Languages/Universal/Strings/Powerset/Value/index.html

Module `Powerset.Value`

module V : sig ... end

include module type of struct include SimplifiedValue end

include module type of struct include StringPower end

include sig ... end

module Set = SimplifiedValue.Set

val is_top : Set.t Mopsa_utils.Core.Top.with_top -> bool

val equal : 
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  bool

val union : 
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top

val inter : 
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top

val diff : 
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top

val add : 
  Set.elt ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top

val fold : 
  (string -> 'a -> 'a) ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  'a ->
  'a

val remove : 
  string ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top

val mem : string -> Set.t Mopsa_utils.Core.Top.with_top -> bool

val partition : 
  (Set.elt -> bool) ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top * Set.t Mopsa_utils.Core.Top.with_top

val exists : (Set.elt -> bool) -> Set.t Mopsa_utils.Core.Top.with_top -> bool

val for_all : (Set.elt -> bool) -> Set.t Mopsa_utils.Core.Top.with_top -> bool

val cardinal : Set.t Mopsa_utils.Core.Top.with_top -> int

val find : Set.elt -> Set.t Mopsa_utils.Core.Top.with_top -> string

val choose : Set.t Mopsa_utils.Core.Top.with_top -> string

val singleton : string -> Set.t Mopsa_utils.Core.Top.with_top

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

val is_empty : Set.t Mopsa_utils.Core.Top.with_top -> bool

val empty : Set.t Mopsa_utils.Core.Top.with_top

val is_singleton : Set.t Mopsa_utils.Core.Top.with_top -> bool

val elements : Set.t Mopsa_utils.Core.Top.with_top -> Set.elt list

val map : 
  (string -> string) ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  Set.t Mopsa_utils.Core.Top.with_top

val iter : (string -> unit) -> Set.t Mopsa_utils.Core.Top.with_top -> unit

val apply : (Set.t -> 'a) -> 'a -> Set.t Mopsa_utils.Core.Top.with_top -> 'a

include sig ... end

val debug : ('a, Format.formatter, unit, unit) format4 -> 'a

include module type of struct include Mopsa_analyzer.MopsaLib.Sig.Abstraction.Simplified_value.DefaultValueFunctions end

val backward_unop : 
  Framework.Core.All.operator ->
  Framework.Core.All.typ ->
  't ->
  Framework.Core.All.typ ->
  't ->
  't

val backward_binop : 
  Framework.Core.All.operator ->
  Framework.Core.All.typ ->
  't ->
  Framework.Core.All.typ ->
  't ->
  Framework.Core.All.typ ->
  't ->
  't * 't

val constant : MopsaLib.constant -> 'a -> Set.t Mopsa_utils.Core.Top.with_top

val unop : 'a -> 'b -> 'c -> 'd -> 'e

val binop : 
  MopsaLib.operator ->
  'a ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  'b ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  'c ->
  Set.t Mopsa_utils.Core.Top.with_top

val filt : 
  StringPower.t ->
  (StringPower.Set.elt -> 'a -> bool) ->
  ('b -> 'a) ->
  'b Mopsa_utils.Core.Top.with_top ->
  StringPower.t

include module type of struct include V end

type t = SimplifiedValue.t

val id : t Framework.Core.All.id

val accept_type : Framework.Core.All.typ -> bool

val name : string

val display : string

val bottom : t

val top : t

val is_bottom : t -> bool

val subset : t -> t -> bool

val join : t -> t -> t

val meet : t -> t -> t

val widen : 'a Framework.Core.All.ctx -> t -> t -> t

val avalue : 'r Framework.Core.All.avalue_kind -> t -> 'r option

val backward : 
  ('v, t) Mopsa_analyzer__Framework__Sig__Abstraction__Value.value_man ->
  Framework.Core.All.expr ->
  t Mopsa_analyzer__Framework__Sig__Abstraction__Value.vexpr ->
  'v ->
  t Mopsa_analyzer__Framework__Sig__Abstraction__Value.vexpr

val filter : bool -> Framework.Core.All.typ -> t -> t

val backward_ext : 
  ('v, t) Mopsa_analyzer__Framework__Sig__Abstraction__Value.value_man ->
  Framework.Core.All.expr ->
  'v Mopsa_analyzer__Framework__Sig__Abstraction__Value.vexpr ->
  'v ->
  'v Mopsa_analyzer__Framework__Sig__Abstraction__Value.vexpr option

val compare_ext : 
  ('v, t) Mopsa_analyzer__Framework__Sig__Abstraction__Value.value_man ->
  Framework.Core.All.operator ->
  bool ->
  Framework.Core.All.expr ->
  'v ->
  Framework.Core.All.expr ->
  'v ->
  ('v * 'v) option

val domain_assumptions : Framework.Core.Alarm.assumption_kind list

val ask : 
  ('v, t) Mopsa_analyzer__Framework__Sig__Abstraction__Value.value_man ->
  ('a, 'r) Framework.Core.All.query ->
  'r option

val print : Framework.Core.All.printer -> t -> unit

val repeat : string -> int -> string

val eval : 
  ('a, Set.t Mopsa_utils.Core.Top.with_top)
    Mopsa_analyzer.MopsaLib.Sig.Abstraction.Value.value_man ->
  MopsaLib.expr ->
  Set.t Mopsa_utils.Core.Top.with_top

val eval_ext : 
  ('a, Set.t Mopsa_utils.Core.Top.with_top)
    Mopsa_analyzer.MopsaLib.Sig.Abstraction.Value.value_man ->
  MopsaLib.expr ->
  'a option

val compare : 
  ('a, Set.t Mopsa_utils.Core.Top.with_top)
    Mopsa_analyzer.MopsaLib.Sig.Abstraction.Value.value_man ->
  Framework.Core.All.operator ->
  bool ->
  MopsaLib.expr ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  MopsaLib.expr ->
  Set.t Mopsa_utils.Core.Top.with_top ->
  V.t * V.t