package codex

You can search for identifiers within the package.

in-package search v0.2.0

The Codex library for building static analysers based on abstract interpretation

Install

dune-project

Dependency

codex.top Edit opam file Versions (1)

Authors

Maintainers

M

Matthieu Lemerre <matthieu.lemerre@cea.fr>

Sources

1.0-rc4.tar.gz

md5=bc7266a140c6886add673ede90e335d3

sha512=8da42c0ff2c1098c5f9cb2b5b43b306faf7ac93b8f5ae00c176918cee761f249ff45b29309f31a05bbcf6312304f86a0d5a000eb3f1094d3d3c2b9b4c7f5c386

doc/codex.domains/Domains/Term_based/Union_find/index.html

Module `Term_based.Union_find`

These functors are placed above a union-find aware non-relational domain (i.e. Nonrelational.MakeUF). They create union between terms when certain operations are performed (for instance Term_based_sig.Domain_S.Binary_Forward.biadd) with one constant argument.

module MakeAdditive
  (C : 
    Term_based_sig.DOMAIN_WITH_UNION
      with type ('a, 'b) Terms.Relation.t = ('a, 'b) Terms.Relations.Additive.t) : 
  Term_based_sig.Domain_S
    with type t = C.t
     and module Terms = C.Terms
     and module Query = C.Query

Builder for the simple "constant difference relation" y = x + c. This relation is defined at Terms.Relations.Additive.

module MakeLinearTwoVarEquality
  (C : 
    Term_based_sig.DOMAIN_WITH_UNION
      with type ('a, 'b) Terms.Relation.t =
             ('a, 'b) Terms.Relations.LinearTwoVarEquality.t) : 
  Term_based_sig.Domain_S
    with type t = C.t
     and module Terms = C.Terms
     and module Query = C.Query

Builder for a linear two variable equality relation f1*x + f2*y + 0, also called TVPE. This relation is defined at Terms.Relations.LinearTwoVarEquality.