[PPL-devel] [GIT] ppl/w3ppl(master): Two more papers added: BHZ09FMSD and BHZ09TCS.

[Patricia Hill]

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

Author: Patricia Hill <p.m.hill at leeds.ac.uk>
Date:   Wed Aug  4 07:51:37 2010 +0100

Two more papers added: BHZ09FMSD and BHZ09TCS.

---

 htdocs/Documentation/papers.raw |   48 +++++++++++++++++++++++++++++++++++++-
 1 files changed, 46 insertions(+), 2 deletions(-)

diff --git a/htdocs/Documentation/papers.raw b/htdocs/Documentation/papers.raw
index 44aa2f3..6547536 100644
--- a/htdocs/Documentation/papers.raw
+++ b/htdocs/Documentation/papers.raw
@@ -165,14 +165,58 @@ R. Bagnara, P. M. Hill, E. Mazzi, and E. Zaffanella.
 
 
 Read this paper if you are interested in using the <EM>weakly
-relational</EM> domains (at present, the PPL supports the weakly
-relational domain of bounded difference shapes). These are domains for
+relational</EM> domains (the PPL supports the weakly
+relational domains of bounded difference shapes and octagonal shapes).
+These are domains for
 numerical abstractions that lie between (in terms of precision and
 efficiency) the domains of intervals and convex polyhedra.
 
 </BLOCKQUOTE>
 </TD>
 </TR>
+
+<TR valign="top">
+<TD align="right">
+[<A HREF="bibliography#BagnaraHZ09FMSD">BHZ09FMSD</A>]
+</TD>
+<TD>
+R. Bagnara, P. M. Hill, and E. Zaffanella.
+  Weakly-Relational Shapes for Numeric Abstractions: Improved
+  Algorithms and Proofs of Correctness.
+  <EM>Formal Methods in System Design</EM>, 35(3):(279-323), 2009.<BR>
+<BLOCKQUOTE>
+
+This is the paper to read if you are interested in how we implement
+the weakly relational domains.
+
+</BLOCKQUOTE>
+</TD>
+</TR>
+</TABLE>
+
+<H3>On Applications</H3>
+
+<TABLE>
+<TR valign="top">
+<TD align="right">
+[<A HREF="bibliography#BagnaraHZ09TCS">BHZ09TCS</A>]
+</TD>
+<TD>
+R. Bagnara, P. M. Hill, and E. Zaffanella.
+  Applications of Polyhedral Computations to the Analysis
+  and Verification of Hardware and Software Systems.
+  <EM>Theoretical Computer Science</EM>,
+  410(46):4672-4691, 2009.<BR>
+[ <A HREF="http://www.cs.unipr.it/ppl/Documentation/BagnaraHZ09TCS.pdf">.pdf</A> ]
+<BLOCKQUOTE>
+
+Read this paper if you are interested in applications of polyhedral
+ computations to the analysis and verification of hardware and
+ software systems
+
+</BLOCKQUOTE>
+</TD>
+</TR>
 </TABLE>
 
 <H3>On Linear Ranking Functions</H3>