Cartesian Factoring of Polyhedra in Linear Relation Analysis

Abstract : 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.
Document type :
Conference papers
Static Analysis: 10th International Symposium, SAS 2003, Jun 2003, San Diego, United States. Springer Verlag, pp.355-365, 2003, LNCS
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00199198
Contributor : Nicolas Halbwachs <>
Submitted on : Tuesday, December 18, 2007 - 3:54:32 PM
Last modification on : Tuesday, December 18, 2007 - 4:49:15 PM
Document(s) archivé(s) le : Monday, April 12, 2010 - 8:22:29 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00199198, version 1

Collections

Citation

Nicolas Halbwachs, David Merchat, Catherine Parent-Vigouroux. Cartesian Factoring of Polyhedra in Linear Relation Analysis. Static Analysis: 10th International Symposium, SAS 2003, Jun 2003, San Diego, United States. Springer Verlag, pp.355-365, 2003, LNCS. <hal-00199198>

Share

Metrics

Record views

181

Document downloads

89