April 2009 - PPL-devel - BUGSENG Mailman

[Fwd: GNU M4 1.4.13 released (stable)]
by Roberto Bagnara 01 Apr '09

01 Apr '09

-------- Original Message -------- Subject: GNU M4 1.4.13 released (stable) Date: Wed, 01 Apr 2009 09:17:09 -0600 From: Eric Blake <ebb9(a)byu.net> To: m4-discuss(a)gnu.org, m4-announce(a)gnu.org, autotools-announce(a)gnu.org, info-gnu(a)gnu.org -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 The GNU M4 team is proud to announce the release of M4 1.4.13. M4 is a macro processing language, and among other uses, it is required by GNU Autoconf for generating configure scripts. This release adds optimizations to improve processing speed. It adds a new configure option, --with-syscmd-shell, to make it possible to select a better shell than /bin/sh for the syscmd builtin. It also patches several portability problems identified since 1.4.12. For a summary of changes and contributors, see: http://git.savannah.gnu.org/cgit/m4.git/log/?id=v1.4.13 or run this command from a git-cloned m4 directory: git shortlog v1.4.12..v1.4.13 To summarize the gnulib-related changes, run this command from a git-cloned gnulib directory: git shortlog v0.0-1196-g8eaac7a..v0.0-2015-gf6778f8 Here are the compressed sources: ftp://ftp.gnu.org/gnu/m4/m4-1.4.13.tar.gz (1.3MB) ftp://ftp.gnu.org/gnu/m4/m4-1.4.13.tar.bz2 (988KB) ftp://ftp.gnu.org/gnu/m4/m4-1.4.13.tar.xz (820KB) Here are the differences since 1.4.12: ftp://ftp.gnu.org/gnu/m4/m4-1.4.12-1.4.13.diff.gz (538KB) Here are the GPG detached signatures[*]: ftp://ftp.gnu.org/gnu/m4/m4-1.4.13.tar.gz.sig ftp://ftp.gnu.org/gnu/m4/m4-1.4.13.tar.bz2.sig ftp://ftp.gnu.org/gnu/m4/m4-1.4.13.tar.xz.sig ftp://ftp.gnu.org/gnu/m4/m4-1.4.12-1.4.13.diff.gz.sig Here are the MD5 and SHA1 checksums: e9e36108b5f9855a82ca4a07ebc0fd2e m4-1.4.13.tar.gz 28f9ccd3ac4da45409251008b911d677 m4-1.4.13.tar.bz2 206b13cb45e95cd2ba60bf401900ab2d m4-1.4.13.tar.xz 75aba989a6dfaa0bbe43d3bcf8d1d47bcd03e39a m4-1.4.13.tar.gz 7ba1834ebf96d0520d526c1c9f5764cc869a9f42 m4-1.4.13.tar.bz2 cc326936397fbf05b046a0c4dd18499f88559ec4 m4-1.4.13.tar.xz [*] You can use either of the above signature files to verify that the corresponding file (without the .sig suffix) is intact. First, be sure to download both the .sig file and the corresponding tarball. Then, run a command like this: gpg --verify m4-1.4.13.tar.gz.sig If that command fails because you don't have the required public key, then run this command to import it: gpg --keyserver keys.gnupg.net --recv-keys F4850180 and rerun the `gpg --verify' command. This release was bootstrapped with the following tools: Autoconf 2.63b Automake 1.10b Gnulib v0.0-2015-gf6778f8 ./NEWS * Noteworthy changes in Version 1.4.13 (2009-04-01) [stable] Released by Eric Blake, based on git version 1.4.12.* ** The manual is now distributed under the terms of FDL 1.3. ** The `divert' and `undivert' builtins have been made more efficient when using temporary files for large diversions. ** The `translit' builtin has been made more efficient when the second argument is short. ** The input engine has been optimized for faster processing. ** The command line option `--debugfile', introduced in 1.4.7, now treats its argument as optional, in order to allow setting the debug output back to stderr when used without an argument; and order is now significant with respect to command line files. You must therefore use `m4 --debugfile=trace file', not `m4 file --debugfile trace'. This change does not affect the deprecated `-o'/`--error-output' option. ** The `syscmd' and `esyscmd' builtins can be configured to use an alternate shell, via the new `configure' option `--with-syscmd-shell'. ** A number of portability improvements inherited from gnulib. - -- GNU M4 team Eric Blake -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (Cygwin) Comment: Public key at home.comcast.net/~ericblake/eblake.gpg Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iEYEARECAAYFAknThXUACgkQ84KuGfSFAYC00gCg0SuekKgEHEMoyto/UIkAgAYo QQkAoNKcpqg105NLPhRbWCKP1TGHfCpW =zDzX -----END PGP SIGNATURE----- -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it

1 0

[GIT] ppl/ppl(master): Adapted test Box/ascii_dump_load1. cc and FIXME removed.
by Enea Zaffanella 01 Apr '09

01 Apr '09

Module: ppl/ppl Branch: master Commit: c37da79744061b6c73f9c854297cd8e2d6610d2e URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=c37da7974406… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Wed Apr 1 16:27:16 2009 +0200 Adapted test Box/ascii_dump_load1.cc and FIXME removed. --- tests/Box/ascii_dump_load1.cc | 18 ++++++++---------- 1 files changed, 8 insertions(+), 10 deletions(-) diff --git a/tests/Box/ascii_dump_load1.cc b/tests/Box/ascii_dump_load1.cc index 22ec0c9..a210688 100644 --- a/tests/Box/ascii_dump_load1.cc +++ b/tests/Box/ascii_dump_load1.cc @@ -161,7 +161,7 @@ test04() { } bool -test06() { +test05() { Variable A(0); Variable B(1); @@ -193,13 +193,13 @@ test06() { } bool -test07() { +test06() { Variable A(0); Variable B(1); Variable C(2); Constraint_System cs; - cs.insert(3*A + C == 5); + cs.insert(3*C == 5); TBox box1(cs); print_constraints(box1, "*** box1(cs) ***"); @@ -242,12 +242,10 @@ test07() { } // namespace BEGIN_MAIN -// FIXME(0.10.1): finish and uncomment all these tests. -// DO_TEST(test01); -// DO_TEST(test02); -// DO_TEST(test03); + DO_TEST(test01); + DO_TEST(test02); + DO_TEST(test03); DO_TEST(test04); -// DO_TEST(test05); -// DO_TEST(test06); -// DO_TEST(test07); + DO_TEST(test05); + DO_TEST(test06); END_MAIN

1 0

[GIT] ppl/ppl(master): Typo fixed.
by Patricia Hill 01 Apr '09

01 Apr '09

Module: ppl/ppl Branch: master Commit: be841361f1f4897750044e44447b1f26b4c398b9 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=be841361f1f4… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Wed Apr 1 14:15:57 2009 +0100 Typo fixed. --- src/Box.templates.hh | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/Box.templates.hh b/src/Box.templates.hh index 0d803b2..0c4d3c0 100644 --- a/src/Box.templates.hh +++ b/src/Box.templates.hh @@ -3389,7 +3389,7 @@ Box<ITV>::limited_CC76_extrapolation_assign(const Box& y, if (space_dim != y.space_dimension()) throw_dimension_incompatible("limited_CC76_extrapolation_assign(y, cs)", y); - // `cs' must be dimension-compatible with the two octagons. + // `cs' must be dimension-compatible with the two boxes. const dimension_type cs_space_dim = cs.space_dimension(); if (space_dim < cs_space_dim) throw_constraint_incompatible("limited_CC76_extrapolation_assign(y, cs)");

1 0

[GIT] ppl/ppl(master): Revised the implementation for
by Patricia Hill 01 Apr '09

01 Apr '09

Module: ppl/ppl Branch: master Commit: f73f6b6af1deb322d9ad299612e99e673b202860 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f73f6b6af1de… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Wed Apr 1 13:27:14 2009 +0100 Revised the implementation for Box<ITV>::limited_cc76_extrapolation_assign() so as to use the limiting constraint system to limit the widened box. The FIXME(0.10.1) there is now removed. --- src/Box.defs.hh | 7 + src/Box.templates.hh | 73 +++++++- tests/Box/Makefile.am | 3 + tests/Box/limitedcc76extrapolation1.cc | 316 ++++++++++++++++++++++++++++++++ 4 files changed, 397 insertions(+), 2 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=f73f6b6a…

1 0

[GIT] ppl/ppl(master): Test adapted and fixme removed.
by Enea Zaffanella 01 Apr '09

01 Apr '09

Module: ppl/ppl Branch: master Commit: 5e0d0b4b32c01d0bcbc257d415b0ad07e95eaf23 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=5e0d0b4b32c0… Author: Enea Zaffanella <zaffanella(a)cs.unipr.it> Date: Wed Apr 1 14:23:34 2009 +0200 Test adapted and fixme removed. --- tests/Box/empty1.cc | 109 +++++++++++++++++++++++++-------------------------- 1 files changed, 54 insertions(+), 55 deletions(-) diff --git a/tests/Box/empty1.cc b/tests/Box/empty1.cc index 703228c..b659b4a 100644 --- a/tests/Box/empty1.cc +++ b/tests/Box/empty1.cc @@ -34,25 +34,25 @@ test01() { TBox box2(4); box1.add_constraint(-x <= 4); - box1.add_constraint(y - x <= 0); - box1.add_constraint(x - y <= -5); + box1.add_constraint(y <= 0); + box1.add_constraint(z >= 0); + box1.add_constraint(y >= 5); - bool empty = box1.is_empty(); + bool empty1 = box1.is_empty(); nout << "*** box1.is_empty() ***" << endl; - nout << (empty ? "true" : "false ") << endl; + nout << (empty1 ? "true" : "false ") << endl; box2.add_constraint(-x <= 4); - box2.add_constraint(y - x <= 0); - box2.add_constraint(x - y <= 5); - box2.add_constraint(z - x <= 1); + box2.add_constraint(y <= 0); + box2.add_constraint(z >= 0); - bool empty1 = box2.is_empty(); + bool empty2 = box2.is_empty(); nout << "*** box2.is_empty() ***" << endl; - nout << (empty1 ? "true" : "false") << endl; + nout << (empty2 ? "true" : "false") << endl; - return !empty1 && empty; + return empty1 && !empty2; } @@ -65,28 +65,28 @@ test02() { TBox box1(4); TBox box2(4); - box1.add_constraint(-x <= 2); - box1.add_constraint(y - x <= -9); - box1.add_constraint(x - y <= -7); + box1.add_constraint(-5*x <= 2); + box1.add_constraint(6*y <= -7); + box1.add_constraint(6*y >= -5); - bool empty = box1.is_empty(); + bool empty1 = box1.is_empty(); print_constraints(box1, "*** box1 ***"); nout << "*** box1.is_empty() ***" << endl; - nout << (empty ? "true" : "false") << endl; + nout << (empty1 ? "true" : "false") << endl; - box2.add_constraint(-x <= 7); - box2.add_constraint(y - x <= 1); - box2.add_constraint(-y <= 2); - box2.add_constraint(z - x <= 1); + box2.add_constraint(-5*x <= 7); + box2.add_constraint(6*y <= 1); + box2.add_constraint(-6*y <= 2); + box2.add_constraint(z <= 1); - bool empty1 = box2.is_empty(); + bool empty2 = box2.is_empty(); print_constraints(box2, "*** box2 ***"); nout << "*** box2.is_empty() ***" << endl; - nout << (empty1 ? "true" : "false") << endl; + nout << (empty2 ? "true" : "false") << endl; - return !empty1 && empty; + return empty1 && !empty2; } bool @@ -103,41 +103,41 @@ test03() { box1.add_constraint(x1 <= 3); box1.add_constraint(x4 <= 3); - box1.add_constraint(x2 - x1 <= 0); - box1.add_constraint(x3 - x1 <= -2); - box1.add_constraint(x5 - x1 <= 2); + box1.add_constraint(x2 <= 0); + box1.add_constraint(x3 <= -2); + box1.add_constraint(x5 <= 2); box1.add_constraint(-x2 <= 0); - box1.add_constraint(x3 - x2 <= 5); - box1.add_constraint(x4 - x3 <= -6); - box1.add_constraint(x1 - x4 <= 5); - box1.add_constraint(x5 - x4 <= 2); + box1.add_constraint(x3 <= 5); + box1.add_constraint(x4 <= -6); + box1.add_constraint(x1 <= 5); + box1.add_constraint(3*x5 <= 2); box1.add_constraint(-x5 <= -5); - box1.add_constraint(x3 - x5 <= 7); + box1.add_constraint(-x5 <= 7); - bool empty = box1.is_empty(); + bool empty1 = box1.is_empty(); nout << "*** box1.is_empty() ***" << endl; - nout << (empty ? "true" : "false") << endl; + nout << (empty1 ? "true" : "false") << endl; box2.add_constraint(x1 <= 3); box2.add_constraint(x4 <= 3); - box2.add_constraint(x2 - x1 <= 0); - box2.add_constraint(x3 - x1 <= 2); - box2.add_constraint(x5 - x1 <= 2); + box2.add_constraint(x2 <= 0); + box2.add_constraint(x3 <= 2); + box2.add_constraint(x5 <= 2); box2.add_constraint(-x2 <= 0); - box2.add_constraint(x3 - x2 <= 5); - box2.add_constraint(x4 - x3 <= 6); - box2.add_constraint(x1 - x4 <= 5); - box2.add_constraint(x5 - x4 <= 2); + box2.add_constraint(x3 <= 5); + box2.add_constraint(x4 <= 6); + box2.add_constraint(x1 <= 5); + box2.add_constraint(x5 <= 2); box2.add_constraint(-x5 <= 5); - box2.add_constraint(x3 - x5 <= 7); + box2.add_constraint(x3 <= 7); - bool empty1 = box2.is_empty(); + bool empty2 = box2.is_empty(); nout << "*** box2.is_empty() ***" << endl; - nout << (empty1 ? "true" : "false") << endl; + nout << (empty2 ? "true" : "false") << endl; - return !empty1 && empty; + return empty1 && !empty2; } bool @@ -150,7 +150,7 @@ test04() { box.add_constraint(A == 0); box.add_constraint(C >= 0); - box.add_constraint(B - C >= 1); + box.add_constraint(B >= 1); bool empty = box.is_empty(); @@ -178,11 +178,11 @@ test05() { else a = 1300000000; - box.add_constraint(x1 - x2 <= -a); - box.add_constraint(x2 - x3 <= -a); - box.add_constraint(x3 - x4 <= a); - box.add_constraint(x4 - x5 <= a); - box.add_constraint(x5 - x1 <= a); + box.add_constraint(2*x1 >= -a); + box.add_constraint(3*x2 >= -a); + box.add_constraint(5*x3 <= a); + box.add_constraint(7*x4 <= a); + box.add_constraint(11*x5 <= a); print_constraints(box, "*** box ***"); @@ -215,12 +215,11 @@ test06() { } // namespace BEGIN_MAIN -// FIXME(0.10.1): finish and uncomment all these tests. - //DO_TEST(test01); - //DO_TEST(test02); - //DO_TEST(test03); - //DO_TEST(test04); - //DO_TEST(test05); + DO_TEST(test01); + DO_TEST(test02); + DO_TEST(test03); + DO_TEST(test04); + DO_TEST(test05); DO_TEST(test06); END_MAIN

1 0

[GIT] ppl/ppl(master): Changes to deal with //FIXME(0.10.1): the following is a bug!
by Patricia Hill 01 Apr '09

01 Apr '09

Module: ppl/ppl Branch: master Commit: 6e74285860c8db3cd382da208e9c9042df406099 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=6e74285860c8… Author: Patricia Hill <p.m.hill(a)leeds.ac.uk> Date: Wed Apr 1 09:31:06 2009 +0100 Changes to deal with //FIXME(0.10.1): the following is a bug! in src/Pointset_Powerset.templates.hh As Grids are non-convex, the constructor for a powerset of nnc polyhedra from a powerset of grids has been implemented separately from the generic case. A test added to show that there was a bug which is now fixed. The "//FIXME(0.10.1): ..." has been removed but a new FIXME added indicating this code will break if other non-convex or non-linear domains are added --- src/Pointset_Powerset.cc | 15 +++++++++++++ src/Pointset_Powerset.defs.hh | 6 +++++ src/Pointset_Powerset.templates.hh | 12 +++++++++- tests/Powerset/fromgrid1.cc | 41 ++++++++++++++++++++++++++++++++++++ 4 files changed, 73 insertions(+), 1 deletions(-) diff --git a/src/Pointset_Powerset.cc b/src/Pointset_Powerset.cc index ee2b119..e9933db 100644 --- a/src/Pointset_Powerset.cc +++ b/src/Pointset_Powerset.cc @@ -307,6 +307,21 @@ PPL::Pointset_Powerset<PPL::NNC_Polyhedron> template <> template <> +PPL::Pointset_Powerset<PPL::NNC_Polyhedron> +::Pointset_Powerset(const Pointset_Powerset<Grid>& y, + Complexity_Class) + : Base(), space_dim(y.space_dimension()) { + Pointset_Powerset& x = *this; + for (Pointset_Powerset<Grid>::const_iterator i = y.begin(), + y_end = y.end(); i != y_end; ++i) + x.sequence.push_back(Determinate<NNC_Polyhedron> + (NNC_Polyhedron(i->element()))); + x.reduced = false; + assert(x.OK()); +} + +template <> +template <> PPL::Pointset_Powerset<PPL::C_Polyhedron> ::Pointset_Powerset(const Pointset_Powerset<NNC_Polyhedron>& y, Complexity_Class) diff --git a/src/Pointset_Powerset.defs.hh b/src/Pointset_Powerset.defs.hh index 4a9c94b..556beb9 100644 --- a/src/Pointset_Powerset.defs.hh +++ b/src/Pointset_Powerset.defs.hh @@ -1400,6 +1400,12 @@ Pointset_Powerset<NNC_Polyhedron> template <> template <> +Pointset_Powerset<NNC_Polyhedron> +::Pointset_Powerset(const Pointset_Powerset<Grid>& y, + Complexity_Class); + +template <> +template <> Pointset_Powerset<C_Polyhedron> ::Pointset_Powerset(const Pointset_Powerset<NNC_Polyhedron>& y, Complexity_Class); diff --git a/src/Pointset_Powerset.templates.hh b/src/Pointset_Powerset.templates.hh index effdd6f..29196e4 100644 --- a/src/Pointset_Powerset.templates.hh +++ b/src/Pointset_Powerset.templates.hh @@ -65,8 +65,18 @@ Pointset_Powerset<NNC_Polyhedron> y_end = y.end(); i != y_end; ++i) x.sequence.push_back(Determinate<NNC_Polyhedron> (NNC_Polyhedron(i->element(), complexity))); - // FIXME(0.10.1): the following is a bug! + + // FIXME: If the domain elements can be represented _exactly_ as NNC + // polyhedra, then having x.reduced = y.reduced is correct. This is + // the case if the domains are both linear and convex which holds + // for all the currently supported instantiations except for + // Grids; for this reason the Grid specialization has a + // separate implementation. For any non-linear or non-convex + // domains (e.g., a domain of Intervals with restrictions or a + // domain of circles) that may be supported in the future, the + // assignment x.reduced = y.reduced will be a bug. x.reduced = y.reduced; + assert(x.OK()); } diff --git a/tests/Powerset/fromgrid1.cc b/tests/Powerset/fromgrid1.cc index 3cbaa58..e8f5fc3 100644 --- a/tests/Powerset/fromgrid1.cc +++ b/tests/Powerset/fromgrid1.cc @@ -372,6 +372,46 @@ test15() { return ok; } +// Constructs the powerset of NNC polyhedra from a powerset of grids +// where set of grids is omega reduced but the constructed set +// of NNC polyhedra is not omega reduced. +bool +test16() { + Variable x(0); + Variable y(1); + + Grid grid1(2); + grid1.add_congruence((x %= 0) / 2); + grid1.add_congruence((y %= 0) / 2); + Grid grid2(2); + grid2.add_congruence((x %= 1) / 2); + grid2.add_congruence((y %= 1) / 0); + + Pointset_Powerset<Grid> pps_gr(grid1); + pps_gr.add_disjunct(grid2); + + // At this stage, pps_gr is omega reduced but pps_gr.reduced flag will + // be set to false. + // So we add this test to set the omega reduction pps_gr.reduced + // flag to true. + bool top_closed = pps_gr.is_topologically_closed(); + + Pointset_Powerset<NNC_Polyhedron> pps(pps_gr); + + // pps is not omega reduced. + bool ok = (pps.size() == 2); + + Pointset_Powerset<NNC_Polyhedron> known_pps(2); + + ok = ok && (pps == known_pps) && pps.OK(); + + Pointset_Powerset<NNC_Polyhedron>::const_iterator i = pps.begin(); + NNC_Polyhedron phi = i->element(); + print_constraints(phi, "*** phi ***"); + + return ok; +} + } // namespace BEGIN_MAIN @@ -390,4 +430,5 @@ BEGIN_MAIN DO_TEST(test13); DO_TEST(test14); DO_TEST(test15); + DO_TEST(test16); END_MAIN

1 0

[GIT] ppl/ppl(master): Updated for PPL 0.10.1.
by Roberto Bagnara 01 Apr '09

01 Apr '09

Module: ppl/ppl Branch: master Commit: a0da4a56d73827f16d6d32af6aa2e2d44232edec URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=a0da4a56d738… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed Apr 1 10:41:21 2009 +0200 Updated for PPL 0.10.1. --- README | 6 +++--- src/Makefile.am | 5 +++-- 2 files changed, 6 insertions(+), 5 deletions(-) diff --git a/README b/README index 964c6f9..ea8ba9f 100644 --- a/README +++ b/README @@ -2,10 +2,10 @@ Copyright (C) 2001-2009 Roberto Bagnara <bagnara(a)cs.unipr.it> See below for the copying conditions. -Parma Polyhedra Library (Release 0.10) -===================================== +Parma Polyhedra Library (Release 0.10.1) +======================================== -This is the release 0.10 of the Parma Polyhedra Library: +This is the release 0.10.1 of the Parma Polyhedra Library: a C++ library for (not necessarily closed) convex polyhedra and other numerical abstractions. diff --git a/src/Makefile.am b/src/Makefile.am index ad7f50a..a066dab 100644 --- a/src/Makefile.am +++ b/src/Makefile.am @@ -52,10 +52,11 @@ # 0.8 5:0:0 # 0.9 6:0:0 # 0.10 7:0:0 +# 0.10.1 8:0:1 -LIBPPL_LT_CURRENT = 7 +LIBPPL_LT_CURRENT = 8 LIBPPL_LT_REVISION = 0 -LIBPPL_LT_AGE = 0 +LIBPPL_LT_AGE = 1 AM_CPPFLAGS = \ -I$(top_builddir) \

1 0

[GIT] ppl/ppl(master): New items for PPL 0.11 added. Other items scheduled for PPL 0.11.
by Roberto Bagnara 01 Apr '09

01 Apr '09

Module: ppl/ppl Branch: master Commit: 0fd5be627f295dd9745620188a894774c1ea95da URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=0fd5be627f29… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Wed Apr 1 10:40:10 2009 +0200 New items for PPL 0.11 added. Other items scheduled for PPL 0.11. --- TODO | 38 +++++++++++++++++++++++++------------- 1 files changed, 25 insertions(+), 13 deletions(-) diff --git a/TODO b/TODO index 7095ba7..d35ffb1 100644 --- a/TODO +++ b/TODO @@ -5,17 +5,21 @@ Enhancements for PPL 0.10.1 or later versions - Fix all the FIXME(0.10.1). -Enhancements for PPL 0.11 or later versions -=========================================== +Enhancements for PPL 0.11 +========================= +- Add the domain of circular linear progressions. +- Finish the domain of intervals. +- Supplement the "preemption" methods of the library allowing for + deterministic mechanisms (e.g., decrementing a counter and throwing + when it reaches zero). This will probably require changing the + current interface based on `abandon_expensive_computations'. - Get rid of ugly assign functions defined in anonymous namespace of - MIP_Problem.cc replacing it with a more general purpose approach. + MIP_Problem.cc replacing it with a more general-purpose approach. - When the PPL has been configured with CPPFLAGS="-DPPL_ARM_CAN_CONTROL_FPU=1" make sure the library initialization procedure checks that the FPU can indeed be controlled, failing if that is not the case. -- Consider switching to MLGMPIDL for the OCaml interface - (see https://bugzilla.redhat.com/show_bug.cgi?id=491712). - Reconsider the datatype for the units parameter in the Watchdog constructors: should we prefer an unsigned? - Rename set_rational_sqrt_precision_parameter to @@ -23,6 +27,22 @@ Enhancements for PPL 0.11 or later versions - Intervals are best instantiated with checked numbers with particular policies: review all the interfaced boxes, augment the testsuite, and update the documentation. +- DO_TEST_F should not cause the output "failed tests" to appear, + but "tests unexpectedly succeeded". +- Reduce the number of FIXMEs to no more than 20. +- Switch to the latest versions of Autoconf and Automake (in beta test + at the time of writing): they provide features we have been looking + for for years. +- Use the OCaml-Autoconf macros: https://forge.ocamlcore.org/frs/?group_id=69 + (see also + http://rwmj.wordpress.com/2009/03/31/using-autoconf-for-ocaml-projects/). + + +Enhancements for PPL 0.11 or later versions +=========================================== + +- Consider switching to MLGMPIDL for the OCaml interface + (see https://bugzilla.redhat.com/show_bug.cgi?id=491712). - Improve the OCaml interface by supporting dynamic loading. - Enhance the support for systems not providing support for the IEEE inexact flag. @@ -33,10 +53,6 @@ Enhancements for PPL 0.11 or later versions - Make the library thread-safe. - Find a way to let the GMP and checked-int versions of the PPL coexist so as to allow using them in the same application. -- Supplement the "preemption" methods of the library allowing for - deterministic mechanisms (e.g., decrementing a counter and throwing - when it reaches zero). This will probably require changing the - current interface based on `abandon_expensive_computations'. - Provide methods computing approximations of the integer convex hull of semantic domains for the case where we are only interested in integral solutions (as is the case, e.g., in many program analyses). Then @@ -76,8 +92,6 @@ Enhancements for PPL 0.11 or later versions or we are otherwise 100% sure that the changed argument and the argument that is read afterward are not aliases (in the latter case an assert(&to != &z) shall be added. -- DO_TEST_F should not cause the output "failed tests" to appear, - but "tests unexpectedly succeeded". - Improve the handling of the --enable-instantiations configure option so that "closure by subdomain" is automatically implemented (e.g., if Pointset_Powerset(X) is specified, X should be automatically @@ -89,8 +103,6 @@ Enhancements for PPL 0.11 or later versions - Consider whether or not our interface for method time_elapse_assign() is the one needed by users: in particular, see if it should take as an argument a generator system, instead of an abstract element. -- Finish the domain of intervals. -- Reduce the number of FIXMEs to no more than 20. - Provide a generic implementation for the `widening with tokens'. - In the OK() methods, instead of having all those #ifndef NDEBUG, it is probably worthwhile to use a suitable defined `barf' stream

1 0