A | |
| Abstract0 [PolkaGrid] | |
| Abstract0 [Ppl] | |
| Abstract0 [Polka] | |
| Abstract0 [Oct] | |
| Abstract0 [Box] | |
| Abstract0 [Apron.Disjunction] | |
| Abstract0 [Apron.Policy] | |
| Abstract0 [Apron] | |
| Abstract1 [PolkaGrid] | |
| Abstract1 [Ppl] | |
| Abstract1 [Polka] | |
| Abstract1 [Oct] | |
| Abstract1 [Box] | |
| Abstract1 [Apron.Disjunction] | |
| Abstract1 [Apron.Policy] | |
| Abstract1 [Apron] | |
| Add [Cudd] | |
| Apron [Bddapron.Expr1.O] | |
| Apron [Bddapron.Expr1] | |
| Apron [Bddapron.Expr0.O] | |
| Apron [Bddapron.Expr0] | |
| Apron |
APRON library
|
| ApronDD [Bddapron] | |
| Apron_lexer [Apron] | |
| Apron_parser [Apron] | |
| Apronexpr [Bddapron] | |
| ApronexprDD [Bddapron] | |
| Asssub [Bdd.Domain0.O] | |
B | |
| Bdd |
Finite-type expressions/properties on top of CUDD
|
| Bdd [Cudd] | |
| Bddapron |
Finite \& numerical expressions/properties on top of CUDD \& APRON
|
| Bdddomain0 [Bddapron] | |
| Bdddomain1 [Bddapron] | |
| Bddleaf [Bddapron] | |
| Benum [Bddapron.Expr1.O] | |
| Benum [Bddapron.Expr1] | |
| Benum [Bddapron.Expr0.O] | |
| Benum [Bddapron.Expr0] | |
| Benum [Bdd.Expr1.O] | |
| Benum [Bdd.Expr1] | |
| Benum [Bdd.Expr0.O] | |
| Benum [Bdd.Expr0] | |
| Bint [Bddapron.Expr1.O] | |
| Bint [Bddapron.Expr1] | |
| Bint [Bddapron.Expr0.O] | |
| Bint [Bddapron.Expr0] | |
| Bint [Bdd.Expr1.O] | |
| Bint [Bdd.Expr1] | |
| Bint [Bdd.Expr0.O] | |
| Bint [Bdd.Expr0] | |
| Bool [Bddapron.Formula.Expr1] | |
| Bool [Bddapron.Formula.Expr0] | |
| Bool [Bddapron.Formula.O.Expr1] | |
| Bool [Bddapron.Formula.O.Expr0] | |
| Bool [Bddapron.Expr2] | |
| Bool [Bddapron.Expr2.O] | |
| Bool [Bddapron.Expr1.O] | |
| Bool [Bddapron.Expr1] | |
| Bool [Bddapron.Expr0.O] | |
| Bool [Bddapron.Expr0] | |
| Bool [Bdd.Expr1.O] | |
| Bool [Bdd.Expr1] | |
| Bool [Bdd.Expr0.O] | |
| Bool [Bdd.Expr0] | |
| Box |
Intervals abstract domain
|
C | |
| Cache [Cudd] | |
| Coeff [Apron] | |
| Common [Bddapron] | |
| Compare [Sette] | |
| Compare [SHGraph] | |
| Compare [Mappe] | |
| Compare [Hashhe] | |
| Compare [Cudd.Weakke] | |
| Cond [Bddapron] | |
| Cond [Bdd] | |
| Condition [Bddapron.ApronexprDD] | |
| Condition [Bddapron.Apronexpr] | |
| Cudd |
Interface to CUDD library
|
| Custom [Cudd] | |
D | |
| DDDnf [Bddapron.Policy] | |
| DHashhe |
Two-way hashtable between two data types
|
| DMappe |
Two-way map between two ordered data types
|
| DPolicy [Bddapron.Policy] | |
| Decompose [Bdd] | |
| Descend [Bddapron] | |
| Dim [Apron] | |
| Disjunction [Apron] | |
| Dnf [Bddapron.Policy] | |
| Domain0 [Bddapron.Policy] | |
| Domain0 [Bddapron] | |
| Domain0 [Bdd] | |
| Domain1 [Bddapron.Policy] | |
| Domain1 [Bddapron] | |
| Domain1 [Bdd] | |
| Domainlevel1 [Bddapron] | |
E | |
| Enum [Bdd] | |
| Env [Bddapron] | |
| Env [Bdd] | |
| Environment [Apron] | |
| Expr [Bdd.Expr0.O] | |
| Expr0 [Bddapron.Formula] | |
| Expr0 [Bddapron.Formula.O] | |
| Expr0 [Bddapron] | |
| Expr0 [Bdd] | |
| Expr1 [Bddapron.Formula] | |
| Expr1 [Bddapron.Formula.O] | |
| Expr1 [Bddapron] | |
| Expr1 [Bdd] | |
| Expr2 [Bddapron] | |
F | |
| FGraph |
Directed graphs, functional API, with two-way information maintained,
|
| FGraph1 |
Directed graphs, functional API, with one-way information maintained,
|
| Formula [Bddapron] | |
G | |
| Generator0 [Apron] | |
| Generator1 [Apron] | |
| Gmp_random |
GMP random generation functions
|
H | |
| Hash [Symbol] |
Hashtables on type
t
|
| Hash [Hashhe.S] | |
| Hash [Cudd] | |
| HashH [SHGraph.T] |
Hash module with hyperedges as keys
|
| HashH [SHGraph.S] | |
| HashV [SHGraph.T] |
Hash module with vertices as keys
|
| HashV [SHGraph.S] | |
| HashX [DHashhe.Param] |
Hashtable for objects in the first place of bindings
|
| HashX [DHashhe.S] | |
| HashY [DHashhe.Param] |
Hashtable for objects in the second place of bindings
|
| HashY [DHashhe.S] | |
| HashedType [Symbol] |
To use hashtables on type
t
|
| Hashhe |
Hash tables and hash functions (extension of standard library module)
|
| HashheI |
Hashhe specialized for keys of type int
|
| HashheIB |
Hashhe specialized for keys of type (int,bool)
|
| HashheS |
Hashhe specialized for keys of type string
|
I | |
| Ilist |
Imbricated lists
|
| Int [Bdd] | |
| Interval [Apron] | |
L | |
| L [Bddapron.Bdddomain0.O] | |
| Lex [Bddapron] | |
| Lin [Bddapron.Apronexpr] | |
| Lincons0 [Apron] | |
| Lincons1 [Apron] | |
| Linexpr0 [Apron] | |
| Linexpr1 [Apron] | |
| List [Bddapron.Expr2] | |
| List [Bddapron.Expr2.O] | |
| List [Bddapron.Expr1.O] | |
| List [Bddapron.Expr1] | |
| List [Bdd.Expr1.O] | |
| List [Bdd.Expr1] | |
M | |
| Make [Bddapron.Domainlevel1] | |
| Make [Sette] |
Functor building an implementation of the set structure
given a totally ordered type.
|
| Make [SetList] |
Functor building an implementation of the SetList structure
given a totally ordered type.
|
| Make [SHGraph] | |
| Make [MultiSetList] |
Functor building an implementation of the MultiSetList structure
given a totally ordered type.
|
| Make [Mappe] |
Functor building an implementation of the map structure
given a totally ordered type.
|
| Make [Hashhe] |
Functor building an implementation of the hashtable structure.
|
| Make [FGraph1] | |
| Make [FGraph] | |
| Make [DMappe] |
Functor building an implementation of the DMappe structure
given two map structures.
|
| Make [DHashhe] |
Functor building an implementation of the DHashtbl structure
given two hashtables
|
| Make [Cudd.Weakke] |
Functor building an implementation of the weak hash table structure.
|
| Man [Cudd] | |
| Manager [Apron] | |
| Map [Symbol] |
Maps on type
t
|
| MapE [FGraph1.T] |
Map module for associating attributes to edges, of type
MapV.key *
MapV.key
|
| MapE [FGraph1.S] |
The Map for edges
|
| MapE [FGraph.T] |
Map module for associating attributes to edges, of type
MapV.key *
MapV.key
|
| MapE [FGraph.S] |
The Map for edges
|
| MapV [FGraph1.T] |
Map module for associating attributes to vertices, of type
MapV.key
|
| MapV [FGraph1.S] |
The Map for vertices
|
| MapV [FGraph.T] |
Map module for associating attributes to vertices, of type
MapV.key
|
| MapV [FGraph.S] |
The Map for vertices
|
| Mapleaf [Cudd] | |
| Mappe |
Association tables over ordered types (extension of standard library module and polymorphic variant)
|
| MappeI |
Mappe specialized for keys of type int
|
| MappeS |
Mappe specialized for keys of type string
|
| MappeX [DMappe.Param] | |
| MappeX [DMappe.S] | |
| MappeY [DMappe.Param] | |
| MappeY [DMappe.S] | |
| Memo [Cudd] | |
| Minterm [Bdd.Enum] | |
| Minterm [Bdd.Int] | |
| Minterm [Bdd.Reg] | |
| Mpf |
GMP multi-precision floating-point numbers
|
| Mpf [Gmp_random] | |
| Mpfr |
MPFR multi-precision floating-point numbers
|
| Mpfr [Gmp_random] | |
| Mpfrf |
MPFR multi-precision floating-point version, functional version
|
| Mpq |
GMP multi-precision rationals
|
| Mpqf |
GMP multi-precision rationals, functional version
|
| Mpz |
GMP multi-precision integers
|
| Mpz [Gmp_random] | |
| Mpzf |
GMP multi-precision integers, functional version
|
| Mtbdd [Cudd] | |
| Mtbddc [Cudd] | |
| Mtbdddomain0 [Bddapron.Policy] | |
| Mtbdddomain0 [Bddapron] | |
| Mtbdddomain1 [Bddapron] | |
| MultiSetList |
Multisets implemented with lists
|
N | |
| Normalform [Bdd] | |
O | |
| O [Bddapron.Formula] | |
| O [Bddapron.Bdddomain0] | |
| O [Bddapron.Mtbdddomain0] | |
| O [Bddapron.Expr2] | |
| O [Bddapron.Expr1] | |
| O [Bddapron.Expr0] | |
| O [Bddapron.Cond] | |
| O [Bddapron.Env] |
Opened signature
|
| O [Bdd.Domain1] | |
| O [Bdd.Domain0] | |
| O [Bdd.Expr1] | |
| O [Bdd.Expr0] | |
| O [Bdd.Env] |
Opened signature
|
| Oct |
Octagon abstract domain.
|
| Ord [Sette.S] |
The ordering module used for this set module.
|
| OrderedType [Symbol] |
To use sets or maps on type
t
|
| Output [Bdd] | |
P | |
| PDHashhe |
Two-way hashtable between two data types, parametrized polymorpphic version
|
| PDMappe |
Two-way map between two ordered data types, parametrized polymorphic version
|
| PDomain0 [Bddapron.Policy] | |
| PHashhe |
Hash tables, parametrized polymorphic version
|
| PMappe |
Association tables over ordered types, parametrized polymorphic version
|
| PMtbdddomain0 [Bddapron.Policy] | |
| PSHGraph |
Oriented hypergraphs, parametrized polymorphic version.
|
| PSette |
Sets over ordered types, parametrized polymorphic version
|
| PWeakke [Cudd] | |
| Parse |
Linking lexer and parser function, with (basic) error messages
|
| Parser [Bddapron] | |
| Parser [Apron] | |
| Policy [Bddapron] | |
| Policy [Box] | |
| Policy [Apron] | |
| Polka |
Convex Polyhedra and Linear Equalities abstract domains
|
| PolkaGrid |
Reduced product of NewPolka polyhedra and PPL grids
|
| Poly [Bddapron.Apronexpr] | |
| Ppl |
Convex Polyhedra and Linear Congruences abstract domains (PPL wrapper)
|
Printing functions using module
Format
| |
R | |
| Rational |
Rational numbers
|
| Reg [Bdd] | |
S | |
| SHGraph |
Oriented hypergraphs
|
| Scalar [Apron] | |
| Set [Symbol] |
Sets on type
t
|
| SetE [FGraph1.S] |
The type of sets of edges
|
| SetE [FGraph.S] |
The type of sets of edges
|
| SetH [SHGraph.T] |
Set module for hyperedges
|
| SetH [SHGraph.S] | |
| SetList |
Sets over totally ordered type with lists.
|
| SetV [SHGraph.T] |
Set module for vertices
|
| SetV [SHGraph.S] | |
| SetV [FGraph1.S] |
The type of sets of vertices
|
| SetV [FGraph.S] |
The type of sets of vertices
|
| Setkey [Mappe.S] | |
| Sette |
Sets over ordered types (extension of standard library module and polymorphic variant)
|
| SetteI |
Sette specialized for keys of type int
|
| SetteS |
Sette specialized for keys of type string
|
| Statistic |
Standard statistics functions
|
| Symbol |
Symbol table, for string management
|
| Syntax [Bddapron] | |
T | |
| T1p |
Taylor1+ abstract domain (beta version)
|
| Tcons0 [Apron] | |
| Tcons1 [Apron] | |
| Texpr0 [Apron] | |
| Texpr1 [Apron] | |
| Time |
Small module to compute the duration of computations
|
| Tree [Bddapron.Apronexpr] | |
U | |
| Union |
Union-find Abstract Data Types
|
| User [Cudd] | |
V | |
| Var [Apron] | |
| Vdd [Cudd] | |
W | |
| Weakke [Cudd] | |
Y | |
| Yacc [Bddapron] |