[PPL-devel] Z-polytopes in PPL
P M Hill
hill at comp.leeds.ac.uk
Thu Jun 18 15:56:44 CEST 2009
On Thu, 18 Jun 2009, Michael Classen wrote:
> this might be a trivial question for some, but I just seem to have
> problems with it:
> I want to adapt our internal LooPo interface to use PPL Grids instead
> of Z-Polytopes. Now, Z-Polytopes were typically defined by a domain
> (or inequality system) and an affine function, which is applied to
> that domain (also alled Lattice).
> Now, in PPL, as far as I can see, you can only create Grids out of
> inequality systems, congruence systems or Grid generators. Is there an
> easy way (function, constructor) to generate a Grid from an inequality
> system + affine function, like in the old Polylib?
It appears as if you think that Grids can represent something akin to
Z-polyhedra. This is not the case, the grids are just that "lattices".
That is, only equalities and congruences are used to define a grid, not
The details about the domain are in the documentation of the PPL and also,
in a more theoretical form, in:
Proceedings of the 16th International Symposium on Logic-based Program
Synthesis and Transformation (LOPSTR'06) (Venice, Italy, July 2006),
volume 4407 of Lecture Notes in Computer Science, G. Puebla, Ed., pp.
and available at
What the PPL does also provide is a product domain as a templatic class
(Partially_Reduced_Product). By instantiating the templatic arguments to
Grid and C_Polyhedron (or NNC_Polyhedron), we can represent something like
the Z-Polytopes in Polylib. There is a third templatic argument for this
class for specifying a (partial) reduction procedure. If you let us know
more exactly what you require for your Loopo interface, we can see if it
is already available or if it would be straightforward to add the
appropriate feature to the domain.
> thank you in advance!
> PPL-devel mailing list
> PPL-devel at cs.unipr.it
More information about the PPL-devel