[PPL-devel] [GIT] ppl/w3ppl(master): Added a section on exact join detection.

[Roberto Bagnara]

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

Author: Roberto Bagnara <bagnara at cs.unipr.it>
Date:   Wed Aug  4 14:59:53 2010 +0200

Added a section on exact join detection.

---

 htdocs/Documentation/papers.raw |   25 +++++++++++++++++++++++++
 1 files changed, 25 insertions(+), 0 deletions(-)

diff --git a/htdocs/Documentation/papers.raw b/htdocs/Documentation/papers.raw
index 24efded..25418c1 100644
--- a/htdocs/Documentation/papers.raw
+++ b/htdocs/Documentation/papers.raw
@@ -198,6 +198,31 @@ and software systems (including the analysis of imperative programs).
 </TR>
 </TABLE>
 
+<H3>On Exact Join Detection</H3>
+
+<TABLE>
+<TR valign="top">
+<TD align="right">
+[<A HREF="bibliography#BagnaraHZ10CGTA">BHZ10</A>]
+</TD>
+<TD>
+R. Bagnara, P. M. Hill, and E. Zaffanella.
+ Exact join detection for convex polyhedra and other numerical
+  abstractions.
+ <em>Computational Geometry: Theory and Applications</em>,
+  43(5):453-473, 2010.
+<BLOCKQUOTE>
+Read this paper if you are interested in the theory we developed
+for computing the <EM>exact join</EM> predicates provided by
+the PPL (exact join detection is the problem of deciding whether
+the least upper bound of two or more numerical abstractions is equal
+to their set-theoretic union).
+</BLOCKQUOTE>
+</TD>
+</TR>
+</TABLE>
+
+
 <H3>On the Synthesis of Linear Ranking Functions</H3>
 <TABLE>