[PPL-devel] [GIT] ppl/ppl(devel): Updated.

[Roberto Bagnara]

Module: ppl/ppl
Branch: devel
Commit: 3d7c1e0242c21b9e8242527097270258f14a4cfe
URL:    http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=3d7c1e0242c21b9e8242527097270258f14a4cfe

Author: Roberto Bagnara <roberto.bagnara at bugseng.com>
Date:   Tue Jun 30 19:10:15 2015 +0200

Updated.

---

 CREDITS |   50 ++++++++++++++++++++++++++------------------------
 1 files changed, 26 insertions(+), 24 deletions(-)

diff --git a/CREDITS b/CREDITS
index a0947c9..7310fc5 100644
--- a/CREDITS
+++ b/CREDITS
@@ -12,8 +12,8 @@ Core Development Team:
 
   Roberto Bagnara       [1] (BUGSENG srl and University of Parma)
   Patricia M. Hill      [2] (BUGSENG srl and University of Leeds)
-  Enea Zaffanella       [3] (BUGSENG srl and University of Parma)
   Abramo Bagnara            (BUGSENG srl)
+  Enea Zaffanella       [3] (University of Parma)
 
 
 Former Members of the Core Development Team:
@@ -29,29 +29,6 @@ Former Members of the Core Development Team:
 Current Contributors:
 ---------------------
 
-  Massimo Benerecetti   (University of Naples) is working on additional
-                        operators on polyhedra.
-
-  Andrea Cimino         (former student of the University of Parma)
-                        wrote most of the mixed integer programming
-                        solver, and also most of the Java and OCaml
-                        interfaces.  He keeps helping us, especially
-                        with the web site.
-
-  Marco Faella          (University of Naples) is working on additional
-                        operators on polyhedra.
-
-  Stefano Minopoli      (University of Naples) is working on additional
-                        operators on polyhedra.
-
-  Marco Poletti         (student of the University of Bologna)
-                        implemented the sparse matrices that are used
-                        in the MIP and PIP solvers of the PPL; he also
-                        did experiments on the parallelization of the
-                        sparse matrices' computations; he is now working
-                        on improving the PPL's memory footprint and
-                        on other improvements to the library.
-
   Alessandro Zaccagnini [4] (University of Parma) has helped with
                         the efficient implementation of GCD and LCM
                         for checked numbers.  He is now working on the
@@ -59,6 +36,9 @@ Current Contributors:
                         Alessandro is always a very valuable source of
                         mathematical advice.
 
+  Paulo Cesar Pereira de Andrade
+                        Helps with Fedora packaging.
+
 
 Past Contributors:
 ------------------
@@ -73,6 +53,9 @@ Past Contributors:
                         whether or not the set-union of two polyhedra
                         is the same as their poly-hull.
 
+  Massimo Benerecetti   (University of Naples) worked on the positive
+                        time-elapse operator on polyhedra.
+
   Fabio Biselli         (student of the University of Parma)
                         did some work on the PPL support for the
                         approximation of floating point computations.
@@ -93,11 +76,19 @@ Past Contributors:
                         one of the four students with which the PPL
                         project started.
 
+  Andrea Cimino         (former student of the University of Parma)
+                        wrote most of the mixed integer programming
+                        solver, and also most of the Java and OCaml
+                        interfaces.  He helped us a lot with the web site.
+
   Katy Dobson           (former student of the University of Leeds)
                         worked on the formalization and definition of
                         algorithms for rational grids and products
                         of grids and polyhedra.
 
+  Marco Faella          (University of Naples) worked on the positive
+                        time-elapse operator on polyhedra.
+
   Giordano Fracasso     (former student of the University of Parma) wrote
                         the initial version of the support for native
                         and checked integer coefficients.
@@ -121,6 +112,9 @@ Past Contributors:
                         with the generation of the library's documentation
                         using Doxygen.
 
+  Stefano Minopoli      (University of Naples) worked on the positive
+                        time-elapse operator on polyhedra.
+
   Matthew Mundell       [6] (formerly at the University of Leeds) worked
                         on the implementation of rational grids.  He has
                         also helped on other implementation issues.
@@ -130,6 +124,14 @@ Past Contributors:
                         project started.  Later, he helped a little
                         with the library's documentation.
 
+  Marco Poletti         (former student of the University of Bologna)
+                        implemented the sparse matrices that are used
+                        in the MIP and PIP solvers of the PPL; he also
+                        did experiments on the parallelization of the
+                        sparse matrices' computations; he also worked
+                        on improving the PPL's memory footprint and
+                        on other improvements to the library.
+
   Barbara Quartieri     (former student of the University of Parma) worked
                         on our implementation of bounded differences and
                         octagons.