Difference between revisions of "Parma Polyhedra Library"
(Created page with "{{Entry |Name=Parma Polyhedra Library |Short description=C++ library for the manipulation of convex polyhedra |Full description=The ''Parma Polyhedra Library'' (PPL) is a modern ...") |
(New version) |
||
Line 3: | Line 3: | ||
|Short description=C++ library for the manipulation of convex polyhedra | |Short description=C++ library for the manipulation of convex polyhedra | ||
|Full description=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 <tt>x + 2 * y + 5 * z <= 7</tt> 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. | |Full description=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 <tt>x + 2 * y + 5 * z <= 7</tt> 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. | ||
+ | |Homepage URL=http://www.cs.unipr.it/ppl/ | ||
|User level=none | |User level=none | ||
− | |||
− | |||
− | |||
|VCS checkout command=:pserver:anoncvs@cvs.cs.unipr.it:/cvs/ppl | |VCS checkout command=:pserver:anoncvs@cvs.cs.unipr.it:/cvs/ppl | ||
|Computer languages=C++ | |Computer languages=C++ | ||
|Documentation note=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/. | |Documentation note=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/. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
|Keywords=convex polyhedra,data-flow analysis,abstract interpretation,model-checking,PPL,Parma Polyhedra Library | |Keywords=convex polyhedra,data-flow analysis,abstract interpretation,model-checking,PPL,Parma Polyhedra Library | ||
− | | | + | |Version identifier=1.2 |
− | |Last review by= | + | |Version date=2016/02/11 |
− | |Last review date= | + | |Version status=beta |
+ | |Version download=ftp://ftp.cs.unipr.it/pub/ppl/releases/1.2/ppl-1.2.tar.bz2 | ||
+ | |Last review by=Alejandroindependiente | ||
+ | |Last review date=2017/03/02 | ||
|Submitted by=Database conversion | |Submitted by=Database conversion | ||
|Submitted date=2011-04-01 | |Submitted date=2011-04-01 | ||
− | | | + | |Status= |
− | | | + | |Is GNU=No |
− | | | + | |License verified date=2001-11-18 |
− | | | + | }} |
+ | {{Project license | ||
+ | |License=GPLv2 | ||
+ | |License verified by=Janet Casey | ||
|License verified date=2001-11-18 | |License verified date=2001-11-18 | ||
− | |||
}} | }} | ||
{{Person | {{Person | ||
+ | |Real name=Robert Bagnara | ||
|Role=Maintainer | |Role=Maintainer | ||
− | + | |Resource URL= | |
− | |||
− | |Resource URL= | ||
}} | }} | ||
{{Person | {{Person | ||
+ | |Real name=Parma Team | ||
|Role=Contributor | |Role=Contributor | ||
− | + | |Resource URL= | |
− | |||
− | |Resource URL= | ||
}} | }} | ||
{{Resource | {{Resource | ||
Line 57: | Line 53: | ||
{{Software category | {{Software category | ||
|Interface=command-line | |Interface=command-line | ||
− | |||
|Use=library | |Use=library | ||
− | |||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Software prerequisite | {{Software prerequisite | ||
Line 73: | Line 63: | ||
|Prerequisite description=gcc 3.x | |Prerequisite description=gcc 3.x | ||
}} | }} | ||
+ | {{Featured}} |
Latest revision as of 17:09, 2 March 2017
Parma Polyhedra Library
http://www.cs.unipr.it/ppl/
C++ library for the manipulation of convex polyhedra
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.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
Contact(s) | Role |
---|---|
Robert Bagnara | Maintainer |
Parma Team | Contributor |
Resources and communication
Audience | Resource type | URI |
---|---|---|
Developer | VCS Repository Webview | http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/?cvsroot=ppl |
Bug Tracking,Developer,Support | mailto:ppl-devel@cs.unipr.it | |
Help | mailto:ppl-announce@cs.unipr.it |
Software prerequisites
Kind | Description |
---|---|
Required to build | gcc 3.x |
Required to use | Gmp 4.1.3 |
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.