|
PPL
|
PPL: The Parma Polyhedra LibraryWhat Is the PPL?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 and a mixed integer linear programming problem solver using an exact-arithmetic version of the simplex algorithm. (More details are available on the PPL's internal mechanisms.)
The Parma Polyhedra Library is:
user friendly
(you write
News
Impatient?You can browse the code or browse the latest hyperlinked user's manual both in HTML format and in PDF. You can also jump straight to the latest version's download area. Visiting the rest of this site will give you access to more information, more documentation and more download options.
Developer's jump station: Tinderbox panel for PPL-HEAD; Tinderbox index; Gitweb; Reference manual. [Page last updated on June 20, 2009, 08:52:54.] |
|||||||||||||||||
|
|
Home | Documentation | FAQ | Download | Applications | Credits | Mailing Lists | Bugs | Contribute | Links | About |