package codex

  1. Overview
  2. Docs
The Codex library for building static analysers based on abstract interpretation

Install 

dune-project
 Dependency

codex.top Edit opam file Versions (1)

Authors

  1. M
    Matthieu Lemerre
  2. J
    Julien Simonnet
  3. O
    Olivier Nicole
  4. P
    Paul Robert
  5. D
    Dorian Lesbre
  6. I
    Iker Canut
  7. C
    Corentin Gendreau
  8. G
    Guillaume Girol
  9. C
    Charles Babu
  10. J
    Jérôme Faucheux

Maintainers

  1. M
    Matthieu Lemerre <matthieu.lemerre@cea.fr>

Sources

1.0-rc4.tar.gz
md5=bc7266a140c6886add673ede90e335d3
sha512=8da42c0ff2c1098c5f9cb2b5b43b306faf7ac93b8f5ae00c176918cee761f249ff45b29309f31a05bbcf6312304f86a0d5a000eb3f1094d3d3c2b9b4c7f5c386

doc/codex.whilelib/Whilelib/While_analysis/Terms/index.html

Module While_analysis.TermsSource

Sourcemodule Condition : sig ... end
Sourcetype superterms
Sourcemodule Relation : sig ... end
Sourcemodule Id : sig ... end
Sourcetype level = int
Sourcetype widening_id = int
Sourcetype !'a1 complete_term =
  1. | Tuple_get : int * cfg_node -> 'res complete_term
  2. | Empty : 'res0 complete_term
  3. | Unknown : level -> 'res1 complete_term
  4. | Mu_formal : {
    1. level : level;
    2. actual : 'res2 t * Operator.Function_symbol.boolean t;
    } -> 'res2 complete_term
  5. | Inductive_var : {
    1. widening_id : widening_id;
    2. level : level;
    3. mutable definition : 'res3 t;
    } -> 'res3 complete_term
  6. | T0 : {
    1. tag : (Operator.Function_symbol.ar0, 'res4) Operator.Function_symbol.function_symbol;
    } -> 'res4 complete_term
  7. | T1 : {
    1. tag : ('a Operator.Function_symbol.ar1, 'res5) Operator.Function_symbol.function_symbol;
    2. a : 'a t;
    3. level : level;
    } -> 'res5 complete_term
  8. | T2 : {
    1. tag : (('a0, 'b) Operator.Function_symbol.ar2, 'res6) Operator.Function_symbol.function_symbol;
    2. a : 'a0 t;
    3. b : 'b t;
    4. level : level;
    } -> 'res6 complete_term
Sourceand !'a0 parent =
  1. | Node : 'b t * ('a, 'b) Relation.t -> 'a parent
  2. | Root
Sourceand any =
  1. | Any : 'res t -> any
Sourceand cfg_node = private
  1. | Nondet of {
    1. id : tuple Id.t;
    2. level : level;
    3. a : tuple;
    4. conda_bool : Operator.Function_symbol.boolean t;
    5. b : tuple;
    6. condb_bool : Operator.Function_symbol.boolean t;
    }
  2. | Mu of {
    1. id : tuple Id.t;
    2. level : level;
    3. init : tuple;
    4. var : tuple;
    5. body : tuple;
    6. body_cond : Operator.Function_symbol.boolean t;
    }
  3. | Inductive_vars of {
    1. id : tuple Id.t;
    2. widening_id : widening_id;
    3. level : int;
    4. mutable def : tuple;
    }
Sourceval polyeq : 'a t -> 'b t -> ('a, 'b) PatriciaTree.cmp
Sourcemodule Any : sig ... end
Sourcemodule CFG_Node : sig ... end
Sourcemodule SUPER_TERMS : sig ... end
Sourceval compare : 'a t -> 'b t -> int
Sourceval hash : 'a t -> int
Sourceval equal : 'a t -> 'b t -> bool
Sourceval pretty : Format.formatter -> 'a t -> unit
Sourceval level : 'a t -> int
Sourcemodule Build : sig ... end
Sourcemodule Utils : sig ... end
Sourceval get_parent : 'a t -> 'a parent
Sourcemodule UnionFind : sig ... end