package mopsa

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

Install

Dune Dependency

Authors

Maintainers

Sources

mopsa-analyzer-v1.1.tar.gz
md5=fdee20e988343751de440b4f6b67c0f4
sha512=f5cbf1328785d3f5ce40155dada2d95e5de5cce4f084ea30cfb04d1ab10cc9403a26cfb3fa55d0f9da72244482130fdb89c286a9aed0d640bba46b7c00e09500

doc/combiner/Combiner/Simplified/SimplifiedToStandard/argument-1-D/index.html

Parameter SimplifiedToStandard.D

include Abstraction.Simplified.SIMPLIFIED

Domain header

*****************

type t

Type of an abstract elements.

val id : t Core.All.id

Domain identifier

val name : string

Domain name

val bottom : t

Least abstract element of the lattice.

val top : t

Greatest abstract element of the lattice.

Predicates

**************

val is_bottom : t -> bool

is_bottom a tests whether a is bottom or not.

val subset : t -> t -> bool

Partial order relation. subset a1 a2 tests whether a1 is related to (or included in) a2.

Operators

*************

val join : t -> t -> t

join a1 a2 computes an upper bound of a1 and a2.

val meet : t -> t -> t

meet a1 a2 computes a lower bound of a1 and a2.

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

widen ctx a1 a2 computes an upper bound of a1 and a2 that ensures stabilization of ascending chains.

Transfer functions

**********************

val init : Core.All.program -> t

Initial abstract element

Printing

************

val domains : Core.All.DomainSet.t
val semantics : Core.All.SemanticSet.t
val routing_table : Core.All.routing_table
val merge : Core.All.path -> t -> (t * Core.All.change_map) -> (t * Core.All.change_map) -> t
val ask : Core.All.DomainSet.t option -> ('a, 'r) Core.All.query -> ('a, t) Abstraction.Simplified.simplified_man -> 'a Core.All.ctx -> t -> 'r option
val print_state : Core.All.DomainSet.t option -> Core.All.printer -> t -> unit
OCaml

Innovation. Community. Security.