The core development team is pleased to announce the availability of PPL 0.12.1, a new release of the Parma Polyhedra Library.
This release includes portability improvements, a couple of new minor features, some interface changes and an important bug fix concerning the PIP solver.
The precise list of user-visible changes is below. For more information, please come and visit the new PPL web site at
http://bugseng.com/products/ppl
On behalf of all the past and present developers listed at http://bugseng.com/products/ppl/credits and in the file CREDITS,
Roberto Bagnara Patricia M. Hill Enea Zaffanella Abramo Bagnara
BUGSENG srl (http://bugseng.com)
-------------------------------------------------------------------------- NEWS for version 0.12.1 (released on April 16, 2012) --------------------------------------------------------------------------
New and Changed Features ========================
o In the C, Java, OCaml and Prolog interfaces, modified the signature of the function/method/predicate for setting the deterministic timeout threshold. The new interfaces take two input values, named `unscaled' and `scale', that are used to compute the threshold value as `unscaled * 2^scale'.
o Added new Box<ITV> methods
bool has_upper_bound(Variable var, Coefficient& n, Coefficient& d, bool& closed) const; bool has_lower_bound(Variable var, Coefficient& n, Coefficient& d, bool& closed) const;
to query a non-empty box for the existence and value of its upper/lower bound on variable `var'. The methods have been also added to all the available language interfaces.
o Two BibTeX databases of papers related to the Parma Polyhedra Library have been added to the distribution (in the `doc' directory).
Bugfixes ========
o Restored the support for deterministic timeouts in the PIP solver (it was removed by accident in PPL 0.12).
o Minor documentation fixes.
o Portability improved.