Categories
Parma Polyhedra Library
The Parma Polyhedra Library (PPL) is a modern and reasonably complete library providing numerical abstractions especially targeted at applications in the field of analysis and verification of complex systems. The PPL can handle all the convex polyhedra that can be defined as the intersection of a finite number of (open or closed) hyperspaces, each described by an equality or inequality (strict or non-strict) with rational coefficients. The PPL also handles restricted classes of polyhedra that offer interesting complexity/precision tradeoffs. The library also supports finite powersets of (any kind of) polyhedra and linear programming problems solved with an exact-arithmetic version of the simplex algorithm.
The Parma Polyhedra Library is user friendly (you write x + 2 * y
+ 5 * z <= 7 when you mean it), fully dynamic (available virtual
memory is the only limitation to the dimension of anything), portable,
exception-safe, rather efficient, thoroughly documented, and free
software. It comes with complete interfaces for C++, C, Java, Objective CAML
and Prolog.
Last updated 6 Mar, 2008
About
Leadership
- Parma Team - Contributor
- Robert Bagnara - Maintainer
Requirements
- Gmp 4.1.3 (Use Requirement)
- gcc 3.x (Build Prerequisite)
Versions
0.9.0
0.9.0 beta released on 2006-03-12
- Released: 12 Mar, 2006
- Code Maturity: Beta
- Source Archive: http://www.cs.unipr.it/ppl/Download/ftp/release...
- Licenses: GPLv2
- Interfaces: Command Line
User Community and Support
User guide in Postscript, PDF, HTML from http://www.cs.unipr.it/ppl/Documentation/; Developer reference in Postscript, PDF, HTML from http://www.cs.unipr.it/ppl/Documentation/.
General Resources
Announcement Resources
Support Resources
Development
Developer Resources
- VCS Checkout Command:
:pserver:anoncvs@cvs.cs.unipr.it:/cvs/ppl - VCS Repository Webview



