The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.

SageMath Logo
This is a mirror of SageMath - Open Source Mathematics Software. Here, you can download SageMath for your system and platform. Not sure what to download? Then follow the download guide. For more information, visit the SageMath website.

Files

↑ up one directory level
Current Directory: upstream/ppl
= Parma Polyhedra Library =

== Description ==
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.

It is written in C++, but comes with interfaces to C, Java, OCaml, and
Prolog. PPL is one of the fastest implementations of polyhedral
computations.

Benchmarks are included in this paper: http://arxiv.org/abs/cs/0612085

== License ==
GPL v3+

== SPKG Maintainers ==
* Volker Braun

== Upstream Contact ==
http://www.cs.unipr.it/ppl/
BUGSENG srl (http://bugseng.com)

Core Development Team
Roberto Bagnara (University of Parma)
Patricia M. Hill (University of Parma)
Enea Zaffanella (University of Parma)

== Dependencies ==
* gmp (or mpir)

== Special Update/Build Instructions ==

=== Patches ===
 * None.

== Changelog ==

=== ppl-1.1 (Jean-Pierre Flori, 25 December 2013) ===
 * #15589: Update to version 1.1.
 * Reenable full testsuite by removing tests_Makefile.in.patch.

=== ppl-1.1pre9.p0 (Jean-Pierre Flori, 6 August 2013) ===
 * #15001: Update to prerelease 1.1pre9 version.
 * Let PPL build on Cygwin.

=== ppl-1.0.p0 (Jeroen Demeyer, 10 June 2013) ===
 * #12672: Build PPL with its C interface if possible, fall back to
   only C++ interface if needed.
 * Add support for PPL_CONFIGURE environment variable.
 * Use "make install" instead of "make install-strip".

=== ppl-1.0 (Volker Braun, 2 March 2013) ===
 * #14232: Update to latest upstream version
 * #14201: Set gmp/gmpxx include dir

=== ppl-0.11.2.p1 (Jeroen Demeyer, 29 February 2012) ===
 * #12608: remove useless "Dependencies check".
 * General clean-up of spkg-install, use patch for patching.

=== ppl-0.11.2.p0 (Simon King, Dec 11, 2011) ===
* #12131: Use --libdir, to make the package work on openSUSE

=== ppl-0.11.2 (Volker Braun, Mar 8, 2011) ===
* Update to newest version
* The SIGILL issue was fixed upstream
* configure --disable-fpmath works now (since we don't use the
  floating point math stuff).

=== ppl-0.11.1 (Volker Braun, Feb 20, 2011) ===
* Update to newest version
* Patch to avoid SIGILL issue, see #9678

=== ppl-0.11 (Volker Braun, Sept 20, 2010) ===
* initial SPKG
FilenameOtherSizeDate
ppl-1.2.tar.bz2torrent14.75 MB2024-10-13 09:45
MD5: 50a757d37cced76e51b97709a4cf455a
ppl-1.1.tar.bz2torrent15.36 MB2016-01-07 23:14
MD5: 98be3e1a272bd5337fbadabb0d3f3d20
ppl-1.1pre9.tar.bz2torrent14.62 MB2013-08-11 00:13
MD5: 8ebd818c18fc8c7fcae6b1d73dc3ae52
ppl-1.0.tar.bz2torrent14.66 MB2013-06-20 00:45
MD5: 1cc4125015bc5e1c87d6922857cd690f
ppl-0.11.2.tar.bz2torrent11.78 MB2013-05-02 22:24
MD5: 37044e98c4c9339223370215896d34ff

These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.