[PPL-devel] [GIT] ppl/w3ppl(master): Announce the new paper on exact join detection.

[Roberto Bagnara]

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

Author: Roberto Bagnara <bagnara at cs.unipr.it>
Date:   Sat Apr 11 14:23:21 2009 +0200

Announce the new paper on exact join detection.

---

 htdocs/news.raw |   16 ++++++++++++++++
 htdocs/ppl.raw  |   51 ++++++++++++++++++---------------------------------
 2 files changed, 34 insertions(+), 33 deletions(-)

diff --git a/htdocs/news.raw b/htdocs/news.raw
index 846e4fa..c68c8c0 100644
--- a/htdocs/news.raw
+++ b/htdocs/news.raw
@@ -10,6 +10,22 @@ of the Parma Polyhedra Library.
 <TABLE>
 
 <TR>
+  <TD VALIGN=TOP><TT>Apr 11, 2009</TT></TD>
+  <TD>
+    <STRONG>New paper on exact join detection</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>
+
+<TR>
   <TD VALIGN=TOP><TT>Feb 22, 2009</TT></TD>
   <TD>
     <STRONG>PPL development moved to Git</STRONG>
diff --git a/htdocs/ppl.raw b/htdocs/ppl.raw
index 7b70310..874c45f 100644
--- a/htdocs/ppl.raw
+++ b/htdocs/ppl.raw
@@ -48,9 +48,25 @@ version 3</A> or any later version).
 <TABLE>
 
 <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>
+
+<TR>
   <TD VALIGN=TOP><TT>Feb 22, 2009</TT></TD>
   <TD>
-    <STRONG><FONT COLOR=red>PPL development moved to Git</FONT></STRONG>
+    <STRONG>PPL development moved to Git</STRONG>
     <BR>
     PPL development moved away from CVS and now uses the
     <A HREF="http://git-scm.com/">Git distributed version control system</A>.
@@ -61,7 +77,7 @@ version 3</A> or any later version).
 <TR>
   <TD VALIGN=TOP><TT>Feb 10, 2008</TT></TD>
   <TD>
-    <STRONG><FONT COLOR=red>New server hosts PPL development</FONT></STRONG>
+    <STRONG>New server hosts PPL development</STRONG>
     <BR>
     AMD Developer Central has donated a bi-quad core machine with
     the latest AMD Opteron 2384 "Shanghai" processors and 16GB of RAM.
@@ -72,37 +88,6 @@ version 3</A> or any later version).
   </TD>
 </TR>
 
-<TR>
-  <TD VALIGN=TOP><TT>Nov 13, 2008</TT></TD>
-  <TD>
-    <STRONG>Congratulations to Katy Dobson</STRONG>
-    <BR>
-     who has been recommended for the degree of PhD with the thesis
-     <A HREF="http://www.comp.leeds.ac.uk/cgi-bin/sis/ext/rs_pub.cgi?cmd=listtheses&pagetype=fac#2008"><EM>Grid Domains for Analysing Software</EM></A>
-     (supervisor <A HREF="http://www.comp.leeds.ac.uk/hill">Patricia Hill</A>).
-  </TD>
-</TR>
-
-<TR>
-  <TD VALIGN=TOP><TT>Nov 4, 2008</TT></TD>
-  <TD>
-    <STRONG>PPL 0.10 has been released</STRONG>
-    <BR>
-    This release, which is under the terms of
-    <A HREF="http://www.gnu.org/copyleft/gpl.html">GPLv3+</A>,
-    has many new features:
-    more abstractions, including <EM>octagonal shapes</EM> and <em>boxes</em>;
-    an improved LP solver supporting Mixed Integer (Linear) Programming
-    problems;
-    a more general powerset domain (named <code>Pointset_Powerset</code>)
-    that can be instantiated with any simple PPL domain (not just polyhedra);
-    better language interfaces for C and Prolog, as well as
-    brand new ones for OCaml and Java;
-    an improved and restructured set of documentation manuals;
-    new and more flexible configuration options.
-  </TD>
-</TR>
-
 </TABLE>
 
 For older news items, see the <A HREF="news">complete news archive</A>.