[GIT] ppl/ppl(master): Updated.

2 Aug 2010

Module: ppl/ppl
Branch: master
Commit: 2f4a9852b2ccaa1de77361797008c2e82d20eb91
URL:    http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=2f4a9852b2cca...
Author: Roberto Bagnara bagnara@cs.unipr.it
Date:   Mon Aug  2 15:26:49 2010 +0200
Updated.
---
NEWS |   10 ++++++----
 1 files changed, 6 insertions(+), 4 deletions(-)

diff --git a/NEWS b/NEWS
index 0dfcdf6..dd7aad4 100644
--- a/NEWS
+++ b/NEWS
@@ -4,7 +4,7 @@ Parma Polyhedra Library NEWS -- history of user-visible changes
--------------------------------------------------------------------------
-NEWS for version 0.11  (to be released on May 8, 2010)
+NEWS for version 0.11  (released on August 4, 2010)
 --------------------------------------------------------------------------
New and Changed Features
@@ -14,13 +14,13 @@ o  New class PIP_Problem provides a Parametric Integer Programming
    (PIP) problem solver (mainly based on P. Feautrier's
    specification).  The implementation combines a parametric dual
    simplex algorithm using exact arithmetic with Gomory's cut
-   generation.  Still under beta testing.
+   generation.
o  New "deterministic" timeout computation facilities: it is now
    possible to set computational bounds (on the library calls taking
    exponential time) that do not depend on the actual elapsed time and
    hence are independent from the actual computation environment (CPU,
-   operating system, etc.).  Still under beta testing.
+   operating system, etc.).
o  New support for termination analysis via the automatic synthesis of
    linear ranking functions.  Given a sound approximation of a loop,
@@ -29,7 +29,7 @@ o  New support for termination analysis via the automatic synthesis of
    witness for termination) and to compute the space of all such
    functions.  In addition, methods are provided to obtain the space
    of all linear quasi-ranking functions, for use in conditional
-   termination analysis.  Still under beta testing.
+   termination analysis.
o  All the PPL semantic objects provide new methods
@@ -85,6 +85,8 @@ o  The C and Java interfaces now support timeout computation facilities.
o  Implementation of general (C and NNC) polyhedra speeded up.
+o  Implementation of the MIP solver speeded up.
+
 o  When the PPL has been configured with
    CPPFLAGS="-DPPL_ARM_CAN_CONTROL_FPU=1", the library initialization
    procedure checks that the FPU can indeed be controlled and fails if

    

Roberto Bagnara

tags (0)

participants (1)