Cartesian Factoring of Polyhedra in Linear Relation Analysis

  • Nicolas Halbwachs
  • David Merchat
  • Catherine Parent-Vigouroux
Conference paper

DOI: 10.1007/3-540-44898-5_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2694)
Cite this paper as:
Halbwachs N., Merchat D., Parent-Vigouroux C. (2003) Cartesian Factoring of Polyhedra in Linear Relation Analysis. In: Cousot R. (eds) Static Analysis. SAS 2003. Lecture Notes in Computer Science, vol 2694. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nicolas Halbwachs
    • 1
  • David Merchat
    • 1
  • Catherine Parent-Vigouroux
    • 1
  1. 1.VérimagGrenobleFrance

Personalised recommendations