[PPL-devel] [GIT] ppl/w3ppl(master): Announce the new bug tracking system.

[Roberto Bagnara]

Module: ppl/w3ppl
Branch: master
Commit: b796f4415776d153be1e27a0a7bec8f1799f0121
URL:    http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=b796f4415776d153be1e27a0a7bec8f1799f0121

Author: Roberto Bagnara <bagnara at cs.unipr.it>
Date:   Sat Jun 13 07:18:57 2009 +0200

Announce the new bug tracking system.

---

 htdocs/Bugs/Bugs.raw |    4 ++--
 htdocs/news.raw      |   12 ++++++++++++
 htdocs/ppl.raw       |   42 +++++++++++++-----------------------------
 3 files changed, 27 insertions(+), 31 deletions(-)

diff --git a/htdocs/Bugs/Bugs.raw b/htdocs/Bugs/Bugs.raw
index 4fc4823..48335c6 100644
--- a/htdocs/Bugs/Bugs.raw
+++ b/htdocs/Bugs/Bugs.raw
@@ -14,8 +14,8 @@ by definition, not smart enough to debug it.
 
 <P>
 <FONT SIZE="+2">T</FONT>he PPL developers encourage you to report
-any bugs you find to
-<A HREF="mailto:ppl-devel at cs.unipr.it">ppl-devel at cs.unipr.it</A>.
+any bugs you find using the
+<HREF="https://www.cs.unipr.it/mantis/">bug tracking system</A>.
 Here `bug' should be interpreted in its broadest sense: outright
 software errors, misfeatures, bad interfaces, missing or unclear
 documentation... whatever is a subject for possible improvement.
diff --git a/htdocs/news.raw b/htdocs/news.raw
index 029cb9d..abf4d36 100644
--- a/htdocs/news.raw
+++ b/htdocs/news.raw
@@ -10,6 +10,18 @@ of the Parma Polyhedra Library.
 <TABLE>
 
 <TR>
+  <TD VALIGN=TOP><TT>Jun 12, 2009</TT></TD>
+  <TD>
+    <STRONG>The PPL has now a bug tracking system</STRONG>
+    <BR>
+    We finally got round to setting up a
+    <HREF="https://www.cs.unipr.it/mantis/">bug tracking system for the PPL</A>.
+    Users and developers are now strongly encouraged to use it
+    for communicating, commenting and keeping track of all PPL issues.
+  </TD>
+</TR>
+
+<TR>
   <TD VALIGN=TOP><TT>Apr 27, 2009</TT></TD>
   <TD>
     <STRONG>Elena graduated!</STRONG>
diff --git a/htdocs/ppl.raw b/htdocs/ppl.raw
index 3345f93..65d53f2 100644
--- a/htdocs/ppl.raw
+++ b/htdocs/ppl.raw
@@ -48,9 +48,21 @@ version 3</A> or any later version).
 <TABLE>
 
 <TR>
+  <TD VALIGN=TOP><TT>Jun 12, 2009</TT></TD>
+  <TD>
+    <STRONG><FONT COLOR=red>The PPL has now a bug tracking system</FONT></STRONG>
+    <BR>
+    We finally got round to setting up a
+    <HREF="https://www.cs.unipr.it/mantis/">bug tracking system for the PPL</A>.
+    Users and developers are now strongly encouraged to use it
+    for communicating, commenting and keeping track of all PPL issues.
+  </TD>
+</TR>
+
+<TR>
   <TD VALIGN=TOP><TT>Apr 27, 2009</TT></TD>
   <TD>
-    <STRONG><FONT COLOR=red>Elena graduated!</FONT></STRONG>
+    <STRONG>Elena graduated!</STRONG>
     <BR>
     Elena Mazzi got her Laurea degree in Mathematics with a
     dissertation on correct widening operators for weakly-relational
@@ -74,34 +86,6 @@ version 3</A> or any later version).
   </TD>
 </TR>
 
-<TR>
-  <TD VALIGN=TOP><TT>Apr 14, 2009</TT></TD>
-  <TD>
-    <STRONG>PPL 0.10.1 has been released</STRONG>
-    <BR>
-    This release includes several important improvements to PPL 0.10,
-    among which is better portability (including the support for
-    cross-compilation), increased robustness, better packaging and
-    several bug fixes.
-  </TD>
-</TR>
-
-<TR>
-  <TD VALIGN=TOP><TT>Apr 11, 2009</TT></TD>
-  <TD>
-    <STRONG><FONT COLOR=red>New paper on exact join detection</FONT></STRONG>
-    <BR>
-    <A HREF="Documentation/bibliography#BagnaraHZ09TRa">Exact Join
-    Detection for Convex Polyhedra and Other Numerical
-    Abstractions</A> presents algorithms to decide whether the
-    lattice-theoretic join of two numerical abstractions (as computed
-    by the <CODE>upper_bound_assign</CODE> methods of the PPL)
-    corresponds to set-theoretic union.  The algorithms described and
-    proved correct in the paper are the ones actually used in the PPL
-    to implement the <CODE>upper_bound_assign_if_exact</CODE> methods.
-  </TD>
-</TR>
-
 </TABLE>
 
 For older news items, see the <A HREF="news">complete news archive</A>.