 |
|
|
|
| HAL : hal-00199198, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| Static Analysis: 10th International Symposium, SAS 2003, San Diego : United States (2003) |
|
|
|
|
| Cartesian Factoring of Polyhedra in Linear Relation Analysis |
|
|
| Nicolas Halbwachs 1David Merchat 1 |
|
|
| (06/2003) |
|
|
|
| Linear Relation Analysis [CH78] suffers from the cost of operations on convex polyhedra, which can be exponential with the number of involved variables. In order to reduce this cost, we propose to detect when a polyhedron is a Cartesian product of polyhedra of lower dimensions, i.e., when groups of variables are unrelated with each other. Classical operations are adapted to work on such factored polyhedra. Our implementation shows encouraging experimental results. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Langage de programmation Informatique/Génie logiciel |
|
|
| abstract interpretation – linear relation analysis – convex polyhedra |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00199198, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00199198 | |
| oai:hal.archives-ouvertes.fr:hal-00199198 | |
| Contributeur : Nicolas Halbwachs | |
| Soumis le : Mardi 18 Décembre 2007, 15:54:32 | |
| Dernière modification le : Mardi 18 Décembre 2007, 16:49:15 | |
