- PPL-devel - BUGSENG Mailman

[GIT] ppl/w3ppl(master): Updated the part about binary distributions.
by Roberto Bagnara 04 Aug '10

04 Aug '10

Module: ppl/w3ppl Branch: master Commit: 5bdc8d6a30982a078a98138ad28dbfec34cda7b9 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=5bdc8d6a30… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed Aug 4 10:27:07 2010 +0200 Updated the part about binary distributions. We no longer distribute binary packages ourselves. --- htdocs/Download/Download.raw | 20 +++++++++++--------- 1 files changed, 11 insertions(+), 9 deletions(-) diff --git a/htdocs/Download/Download.raw b/htdocs/Download/Download.raw index 17d1351..51e2051 100644 --- a/htdocs/Download/Download.raw +++ b/htdocs/Download/Download.raw @@ -43,7 +43,9 @@ the Parma Polyhedra Library resources (sources, binaries and more). <H3>Binary distributions</H3> <P> -Below is a list of the available PPL binary distributions. +Below is a partial list of the available PPL binary distributions. +Please <A HREF="mailto:ppl-devel@cs.unipr.it">let us know</A> +the ones we are missing. <TABLE BORDER=3 CELLSPACING=3 CELLPADDING=3> <TR> @@ -80,15 +82,9 @@ Below is a list of the available PPL binary distributions. <A HREF="http://packages.debian.org/source/sid/ppl">sid</A> </TD> <TD> - <A HREF="@BASE_DIR@Download/ftp/releases/0.10/fedora/8/">8</A> + <A HREF="http://rpm.pbone.net/index.php3?stat=3&limit=1&srodzaj=1&dl=40&search=ppl&d…"><CODE>rpm.pbone.net</CODE> <BR> - <A HREF="@BASE_DIR@Download/ftp/releases/@PPL_VERSION@/fedora/9/">9</A> - <BR> - <A HREF="@BASE_DIR@Download/ftp/releases/@PPL_VERSION@/fedora/10/">10</A> - <BR> - <A HREF="@BASE_DIR@Download/ftp/releases/@PPL_VERSION@/fedora/11/">11</A> - <BR> - <A HREF="@BASE_DIR@Download/ftp/releases/@PPL_VERSION@/fedora/12/">12</A> + <A HREF="https://admin.fedoraproject.org/pkgdb/acls/name/ppl"><CODE>admin.fedoraproject.org</CODE></A> </TD> <TD> <A HREF="http://packages.gentoo.org/package/dev-libs/ppl">Gentoo</A> @@ -99,11 +95,17 @@ Below is a list of the available PPL binary distributions. <A HREF="http://download.opensuse.org/repositories/devel://gcc/openSUSE_11.0/">11.0</A> <BR> <A HREF="http://download.opensuse.org/repositories/devel://gcc/openSUSE_11.1/">11.1</A> + <BR> + <A HREF="http://download.opensuse.org/repositories/devel://gcc/openSUSE_11.2/">11.2</A> </TD> <TD> <A HREF="http://packages.ubuntu.com/hu/source/intrepid/ppl">Intrepid</A> <BR> <A HREF="http://packages.ubuntu.com/hu/source/jaunty/ppl">Jaunty</A> + <BR> + <A HREF="http://packages.ubuntu.com/hu/source/karmic/ppl">Karmic</A> + <BR> + <A HREF="http://packages.ubuntu.com/hu/source/lucid/ppl">Lucid</A> </TD> <TD> <A HREF="http://pdb.finkproject.org/pdb/package.php/ppl">Fink</A>

1 0

[GIT] ppl/w3ppl(master): Two more papers added: BHZ09FMSD and BHZ09TCS.
by Patricia Hill 04 Aug '10

04 Aug '10

Module: ppl/w3ppl Branch: master Commit: 2a2c83fef9c3a2b77b9bfc18bf66a56aab89e5e9 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=2a2c83fef9… Author: Patricia Hill <p.m.hill(a)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>

1 0

[GIT] ppl/w3ppl(master): Updated with paper on linear ranking functions and that the sttp paper
by Patricia Hill 03 Aug '10

03 Aug '10

Module: ppl/w3ppl Branch: master Commit: e3bef523bc4b9767c4dbd5b2bd9afc86c85c9a2c URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=e3bef523bc… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Tue Aug 3 21:24:40 2010 +0100 Updated with paper on linear ranking functions and that the sttp paper is now published. Note that the source file address for the paper on linear ranking functions is fictitious and either this should be revised or a pdf version of the paper added at that address. (http://www.cs.unipr.it/ppl/Documentation/BagnaraMPZ10TR) --- htdocs/Documentation/papers.raw | 43 +++++++++++++++++++++++++++++++++++++- 1 files changed, 41 insertions(+), 2 deletions(-) diff --git a/htdocs/Documentation/papers.raw b/htdocs/Documentation/papers.raw index c4444be..44aa2f3 100644 --- a/htdocs/Documentation/papers.raw +++ b/htdocs/Documentation/papers.raw @@ -122,8 +122,9 @@ supported by the PPL, is fully described. <TD> R. Bagnara, P. M. Hill, and E. Zaffanella. Widening operators for powerset domains. - <EM>Software Tools for Technology Transfer</EM>, 2005. - To appear.<BR> + <EM>Software Tools for Technology Transfer</EM>, + 8(4-5):449-466, 2006.<BR> +[ <A HREF="http://www.cs.unipr.it/ppl/Documentation/BagnaraHZ06STTT.pdf">.pdf</A> ] <BLOCKQUOTE> Read this paper if you are interested in using powersets to express @@ -174,6 +175,44 @@ efficiency) the domains of intervals and convex polyhedra. </TR> </TABLE> +<H3>On Linear Ranking Functions</H3> +<TABLE> + +<TR valign="top"> +<TD align="right"> +[<A HREF="http://www.cs.unipr.it/ppl/Documentation/BagnaraMPZ10TR"></A>] +</TD> +<TD> +R. Bagnara, F. Mesnard, F. Pescetti, and E. Zaffanella. + The Automatic Synthesis of Linear Ranking Functions. + Submitted for publication, 2010.<BR> +<BLOCKQUOTE> + + +Read this paper if you are interested in synthesizing ranking +functions for termination analysis. The classical technique for +proving termination of a generic sequential computer program involves +the synthesis of a <EM>ranking function</EM> for each loop of the +program. <EM>Linear</EM> ranking functions are particularly +interesting because many terminating loops admit one and algorithms +exist to automatically synthesize it. In this paper we present two +such algorithms: one based on work dated 1991 by Sohn and Van~Gelder; +the other, due to Podelski and Rybalchenko, dated 2004. Remarkably, +while the two algorithms will synthesize a linear ranking function +under exactly the same set of conditions, the former is mostly unknown +to the community of termination analysis and its general applicability +has never been put forward before the present paper. In this paper we +thoroughly justify both algorithms, we prove their correctness, we +compare their worst-case complexity and experimentally evaluate their +efficiency, and we present an open-source implementation of them that +will make it very easy to include termination-analysis capabilities in +automatic program verifiers. + +</BLOCKQUOTE> +</TD> +</TR> +</TABLE> + <HR> <A NAME="historical">

1 0

[GIT] ppl/ppl(master): Updated and typo fixed.
by Patricia Hill 03 Aug '10

03 Aug '10

Module: ppl/ppl Branch: master Commit: 984d8ba3c2d7d9e2302d7f369d07ca50c72c7351 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=984d8ba3c2d7… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Tue Aug 3 20:49:26 2010 +0100 Updated and typo fixed. --- CREDITS | 10 +++++----- 1 files changed, 5 insertions(+), 5 deletions(-) diff --git a/CREDITS b/CREDITS index c797359..c047e89 100644 --- a/CREDITS +++ b/CREDITS @@ -58,7 +58,7 @@ Past Contributors: ------------------ Roberto Amadini (student of the University of Parma) - did some working on the PPL support for the + did some work on the PPL support for the approximation of floating point computations. Irene Bacchi (former student of the University of Parma) worked @@ -88,10 +88,10 @@ Past Contributors: solver, and also most of the Java and OCaml interfaces. - Katy Dobson [6] (University of Leeds) worked on the - formalization and definition of algorithms for - rational grids and products of grids and - polyhedra. + Katy Dobson [6] (former student of the University of Leeds) + worked on the formalization and definition of + algorithms for rational grids and products + of grids and polyhedra. Giordano Fracasso (University of Parma) wrote the initial version of the support for native and checked integer

1 0

[GIT] ppl/w3ppl(master): Updated and fixed a few bugs.
by Patricia Hill 03 Aug '10

03 Aug '10

Module: ppl/w3ppl Branch: master Commit: c401e378d113c3df2c1bf87c5ab2313d7f03d35b URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=c401e378d1… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Tue Aug 3 20:47:13 2010 +0100 Updated and fixed a few bugs. --- htdocs/Credits/Credits.raw | 16 ++++++++-------- 1 files changed, 8 insertions(+), 8 deletions(-) diff --git a/htdocs/Credits/Credits.raw b/htdocs/Credits/Credits.raw index 4081601..0ee838f 100644 --- a/htdocs/Credits/Credits.raw +++ b/htdocs/Credits/Credits.raw @@ -92,8 +92,8 @@ maintained and improved by the following people: <LI> Roberto Amadini (student of the University of Parma) - is working on the PPL support for the approximation - of floating point computations. + did some work on the PPL support for the + approximation of floating point computations. </LI> <LI> Irene Bacchi @@ -106,8 +106,8 @@ maintained and improved by the following people: <LI> Fabio Biselli (student of the University of Parma) - is working on the PPL support for the approximation - of floating point computations. + did some work on the PPL support for the + approximation of floating point computations. </LI> <LI> @@ -135,10 +135,10 @@ maintained and improved by the following people: </LI> <LI> <A HREF="http://www.comp.leeds.ac.uk/katyd">Katy Dobson</A> - (University of Leeds) is working on the - formalization and definition of algorithms - for rational grids and products of grids - and polyhedra. + (former student of the University of Leeds) + worked on the formalization and definition of + algorithms for rational grids and products + of grids and polyhedra. </LI> <LI> Giordano Fracasso

1 0

[GIT] ppl/w3ppl(master): Updated paragraph about the University of Leeds.
by Patricia Hill 03 Aug '10

03 Aug '10

Module: ppl/w3ppl Branch: master Commit: 93834253f0d6cc13c9ea2b42bcc2985c86372a3d URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=93834253f0… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Tue Aug 3 14:05:38 2010 +0100 Updated paragraph about the University of Leeds. --- htdocs/Contribute/Contribute.raw | 9 +++------ 1 files changed, 3 insertions(+), 6 deletions(-) diff --git a/htdocs/Contribute/Contribute.raw b/htdocs/Contribute/Contribute.raw index dc18070..417c153 100644 --- a/htdocs/Contribute/Contribute.raw +++ b/htdocs/Contribute/Contribute.raw @@ -186,12 +186,9 @@ progetto a Leeds sotto la direzione di Patricia Hill (vedi oltre). <P> <IMG SRC="../images/en" ALT="English"> -If you are a student of the University of Leeds and you think that a -thesis or project may interest you, please get in touch with -<A HREF="http://www.cs.unipr.it/~hill/">Patricia M. Hill</A>. -If you would like to spend some time abroad, then why not consider a year -in Parma? -There is now an <EM>Erasmus</EM> link between the Universities of +If you are a student of the University of Leeds and would like to +spend some time abroad, then why not consider a year in Parma? +There is an <EM>Erasmus</EM> link between the Universities of Leeds and Parma so that undergraduates in Computing-related programmes at Leeds can spend an extra (third year) of study at Parma. Project work on the PPL (while on this programme) would be particularly

1 0

[GIT] ppl/w3ppl(master): Updated following the CREDITS file in the ppl.
by Patricia Hill 03 Aug '10

03 Aug '10

Module: ppl/w3ppl Branch: master Commit: 2e771410e35c08c580c156d0c55bf7b653eee84a URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=2e771410e3… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Tue Aug 3 12:08:43 2010 +0100 Updated following the CREDITS file in the ppl. --- htdocs/Credits/Credits.raw | 55 ++++++++++++++++++++++--------------------- 1 files changed, 28 insertions(+), 27 deletions(-) diff --git a/htdocs/Credits/Credits.raw b/htdocs/Credits/Credits.raw index 8365976..4081601 100644 --- a/htdocs/Credits/Credits.raw +++ b/htdocs/Credits/Credits.raw @@ -44,12 +44,6 @@ maintained and improved by the following people: <UL> <LI> - Roberto Amadini - (student of the University of Parma) - is working on the PPL support for the approximation - of floating point computations. - </LI> - <LI> Abramo Bagnara (Opera Unica) rewrote and generalized the support for checked coefficients. He also @@ -59,33 +53,12 @@ maintained and improved by the following people: design and implementation issues. </LI> <LI> - Fabio Biselli - (student of the University of Parma) - is working on the PPL support for the approximation - of floating point computations. - - </LI> - <LI> Fabio Bossi (student of the University of Parma) is working on the PPL support for the approximation of floating point computations. </LI> <LI> - 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. - </LI> - <LI> - <A HREF="http://www.comp.leeds.ac.uk/katyd">Katy Dobson</A> - (University of Leeds) is working on the - formalization and definition of algorithms - for rational grids and products of grids - and polyhedra. - </LI> - <LI> <A HREF="http://www.prism.uvsq.fr/~fgalea/">François Galea</A> (University of Versailles) is working at the implementation of the Parametric Integer @@ -115,6 +88,13 @@ maintained and improved by the following people: <P> <UL> + + <LI> + Roberto Amadini + (student of the University of Parma) + is working on the PPL support for the approximation + of floating point computations. + </LI> <LI> Irene Bacchi (former student of the University of Parma) @@ -124,6 +104,13 @@ maintained and improved by the following people: of two polyhedra is the same as their poly-hull. </LI> <LI> + Fabio Biselli + (student of the University of Parma) + is working on the PPL support for the approximation + of floating point computations. + + </LI> + <LI> Danilo Bonardi (former student of the University of Parma) worked on a development branch where he experimented @@ -140,6 +127,20 @@ maintained and improved by the following people: project started. </LI> <LI> + 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. + </LI> + <LI> + <A HREF="http://www.comp.leeds.ac.uk/katyd">Katy Dobson</A> + (University of Leeds) is working on the + formalization and definition of algorithms + for rational grids and products of grids + and polyhedra. + </LI> + <LI> Giordano Fracasso (University of Parma) wrote the initial version of the support for native and checked integer

1 0

[GIT] ppl/ppl(floating_point): Do not use log2 to compute the base 2 logarithm of
by Fabio Bossi 03 Aug '10

03 Aug '10

Module: ppl/ppl Branch: floating_point Commit: f6167277a1078a7891e62097d4e034830001f373 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f6167277a107… Author: Fabio Bossi <bossi(a)cs.unipr.it> Date: Tue Aug 3 11:09:28 2010 +0200 Do not use log2 to compute the base 2 logarithm of an integer. --- src/Float.defs.hh | 9 +++++++++ src/Float.inlines.hh | 33 +++++++++++++++++++++++++++++++++ src/Float.templates.hh | 3 +-- src/Linear_Form.templates.hh | 3 +-- 4 files changed, 44 insertions(+), 4 deletions(-) diff --git a/src/Float.defs.hh b/src/Float.defs.hh index 4e66c05..b437184 100644 --- a/src/Float.defs.hh +++ b/src/Float.defs.hh @@ -369,6 +369,15 @@ public: }; #endif +// FIXME: is this the right place for this function? +#ifdef PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS +//! Returns the position of the most significative bit in \p a. +#endif // defined(PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS) +unsigned int ld2(unsigned long long a); + +/* FIXME: some of the following documentation should probably be + under PPL_DOXYGEN_INCLUDE_IMPLEMENTATION_DETAILS */ + /*! \brief Returns <CODE>true</CODE> if and only if there is some floating point number that is representable by \p f2 but not by \p f1. diff --git a/src/Float.inlines.hh b/src/Float.inlines.hh index 219797b..2b9c3f2 100644 --- a/src/Float.inlines.hh +++ b/src/Float.inlines.hh @@ -451,6 +451,39 @@ is_less_precise_than(Floating_Point_Format f1, Floating_Point_Format f2) { return f1 < f2; } +#if defined(__GNUC__) +inline unsigned int ld2(unsigned long long a) { + return __builtin_clzll(a) ^ (sizeof(a)*8 - 1); +} +#else +unsigned int ld2(unsigned long long v) { + unsigned r = 0; + if (v >= 0x100000000ULL) { + v >>= 32; + r += 32; + } + if (v >= 0x10000) { + v >>= 16; + r += 16; + } + if (v >= 0x100) { + v >>= 8; + r += 8; + } + if (v >= 0x10) { + v >>= 4; + r += 4; + } + if (v >= 4) { + v >>= 2; + r += 2; + } + if (v >= 2) + r++; + return r; +} +#endif + template <typename FP_Interval_Type> inline void affine_form_image(std::map<dimension_type, diff --git a/src/Float.templates.hh b/src/Float.templates.hh index f062fde..287fb4f 100644 --- a/src/Float.templates.hh +++ b/src/Float.templates.hh @@ -113,8 +113,7 @@ const FP_Interval_Type& compute_absolute_error( // We assume that f_base is a power of 2. analyzer_format omega; - int power = static_cast<int>(log2(f_base)) * - (1 - f_exponent_bias - f_mantissa_bits); + int power = ld2(f_base) * (1 - f_exponent_bias - f_mantissa_bits); omega = std::max(static_cast<analyzer_format>(ldexpl(1.0, power)), std::numeric_limits<analyzer_format>::denorm_min()); diff --git a/src/Linear_Form.templates.hh b/src/Linear_Form.templates.hh index 5bb64c0..596e095 100644 --- a/src/Linear_Form.templates.hh +++ b/src/Linear_Form.templates.hh @@ -419,8 +419,7 @@ Linear_Form<C>::relative_error( C error_propagator; // We assume that f_base is a power of 2. - int power = static_cast<int>(log2(f_base)) * - (-f_mantissa_bits); + int power = ld2(f_base) * (-f_mantissa_bits); analyzer_format lb = -static_cast<analyzer_format>(ldexpl(1.0, power)); error_propagator.build(i_constraint(GREATER_OR_EQUAL, lb),

1 0

[GIT] ppl/w3ppl(master): Updated.
by Roberto Bagnara 03 Aug '10

03 Aug '10

Module: ppl/w3ppl Branch: master Commit: d62335323d3e4593666c4009e1af47a8efde0ffb URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=d62335323d… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Aug 3 09:15:46 2010 +0200 Updated. --- htdocs/FAQ.raw | 6 ++---- 1 files changed, 2 insertions(+), 4 deletions(-) diff --git a/htdocs/FAQ.raw b/htdocs/FAQ.raw index 4c9ec50..04baed2 100644 --- a/htdocs/FAQ.raw +++ b/htdocs/FAQ.raw @@ -456,10 +456,8 @@ they can choose among the C, C++, Java, OCaml and Prolog interfaces. <BR> <B>A:</B> -For PPL 0.11 we are adding new operations and numerical abstractions -that allow to approximate the result of bounded integer computations. If all goes well, PPL 0.12 will be focused on facilities to support -the analysis of floating point computations. +the analysis of floating point and machine integer computations. For the same release we hope to add serialization for all PPL objects. <P> @@ -469,4 +467,4 @@ For the same release we hope to add serialization for all PPL objects. <BR> <B>A:</B> -It is difficult to say. We hope to release PPL 0.11 in May/June 2009. +It is difficult to say. We hope to release PPL 0.12 in January/February 2011.

1 0

[GIT] ppl/w3ppl(master): There are no known bugs in PPL 0.11.
by Roberto Bagnara 03 Aug '10

03 Aug '10

Module: ppl/w3ppl Branch: master Commit: 343e44d343e12fd0af3c7513ab8bf99633f6ebdd URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=343e44d343… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Tue Aug 3 09:04:24 2010 +0200 There are no known bugs in PPL 0.11. --- htdocs/Bugs/Bugs.raw | 7 +++---- 1 files changed, 3 insertions(+), 4 deletions(-) diff --git a/htdocs/Bugs/Bugs.raw b/htdocs/Bugs/Bugs.raw index 4b2bd94..727d624 100644 --- a/htdocs/Bugs/Bugs.raw +++ b/htdocs/Bugs/Bugs.raw @@ -32,16 +32,14 @@ to Report Bugs Effectively</A>, by Simon Tatham. <H2>Known Bugs in PPL @PPL_VERSION@</H2> - +

1 0