SPELL=ppl
VERSION=0.11
SOURCE="${SPELL}-${VERSION}.tar.bz2"
SOURCE_URL[0]=ftp://ftp.cs.unipr.it/pub/${SPELL}/releases/${VERSION}/${SOURCE}
SOURCE_HASH=sha512:55624a8ac8a54c3eda9e604e4c8985afd79b17939d118c5f405dc350b4dce21eeeacef6a7a0d015944b3c1f03cebfcf6d37972d71c0b23d944be562ad74319cf
SOURCE_DIRECTORY="${BUILD_DIRECTORY}/${SPELL}-${VERSION}"
WEB_SITE="http://www.cs.unipr.it/ppl"
LICENSE[0]=GPL
ENTERED=20110205
SHORT="a numerical abstraction for analysis and verification of complex systems"
cat << EOF
The Parma Polyhedra Library (PPL) provides numerical abstractions especially
targeted at applications in the field of analysis and verification of
complex systems. These abstractions include convex polyhedra, defined
as the intersection of a finite number of (open or closed) halfspaces,
each described by a linear inequality (strict or non-strict) with rational
coefficients; some special classes of polyhedra shapes that offer interesting
complexity/precision tradeoffs; and grids which represent regularly spaced
points that satisfy a set of linear congruence relations. The library also
supports finite powersets and products of (any kind of) polyhedra and grids,
a mixed integer linear programming problem solver using an exact-arithmetic
version of the simplex algorithm, a parametric integer programming solver,
and primitives for the termination analysis via the automatic synthesis of
linear ranking functions.
EOF