November 2009 - PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(pip): Minor fix fixes in standalone solver.
by François Galea 16 Nov '09

16 Nov '09

Module: ppl/ppl Branch: pip Commit: 166aa73867fc30ec4dac5876ca0775f726d27c00 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=166aa73867fc… Author: François Galea <francois.galea(a)uvsq.fr> Date: Mon Nov 16 18:01:21 2009 +0100 Minor fix fixes in standalone solver. --- demos/ppl_pips/ppl_pips.cc | 2 ++ 1 files changed, 2 insertions(+), 0 deletions(-) diff --git a/demos/ppl_pips/ppl_pips.cc b/demos/ppl_pips/ppl_pips.cc index b7a0b98..eb47f34 100644 --- a/demos/ppl_pips/ppl_pips.cc +++ b/demos/ppl_pips/ppl_pips.cc @@ -440,6 +440,8 @@ struct option long_options[] = { {"version", no_argument, 0, 'V'}, {"check", required_argument, 0, 'c'}, #endif + {"first", no_argument, 0, 'f'}, + {"deepest", no_argument, 0, 'd'}, {0, 0, 0, 0} }; #endif

1 0

[GIT] ppl/ppl(pip): Fixed a bug in standalone solver when using PIPlib files with a big parameter .
by François Galea 16 Nov '09

16 Nov '09

Module: ppl/ppl Branch: pip Commit: 1feefaab34eb0c23699771197564175a7dc8e575 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=1feefaab34eb… Author: François Galea <francois.galea(a)uvsq.fr> Date: Mon Nov 16 17:39:14 2009 +0100 Fixed a bug in standalone solver when using PIPlib files with a big parameter. --- demos/ppl_pips/ppl_pips.cc | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/demos/ppl_pips/ppl_pips.cc b/demos/ppl_pips/ppl_pips.cc index d4e352f..b7a0b98 100644 --- a/demos/ppl_pips/ppl_pips.cc +++ b/demos/ppl_pips/ppl_pips.cc @@ -342,7 +342,7 @@ public: in >> num_vars >> num_params >> num_constraints >> num_ctx_rows >> tmp >> solve_integer; - bignum_column = (tmp == -1) ? PPL::not_a_dimension() : tmp; + bignum_column = (tmp == -1) ? PPL::not_a_dimension() : (tmp-1); if (solve_integer != 1) { std::cerr << "Can only solve integer problems." << std::endl; return false;

1 0

[GIT] ppl/ppl(pip): Added support for an arbitrarily big parameter.
by François Galea 13 Nov '09

13 Nov '09

Module: ppl/ppl Branch: pip Commit: 6af59504f0e2dd58a505323dbf5435cbce0c21f1 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=6af59504f0e2… Author: François Galea <francois.galea(a)uvsq.fr> Date: Fri Nov 13 18:03:48 2009 +0100 Added support for an arbitrarily big parameter. --- demos/ppl_pips/ppl_pips.cc | 10 ++++------ src/PIP_Problem.cc | 38 ++++++++++++++++++++++++++++++++++++-- src/PIP_Problem.defs.hh | 10 ++++++++++ src/PIP_Problem.inlines.hh | 6 ++++++ src/PIP_Problem.templates.hh | 3 ++- src/PIP_Tree.cc | 33 +++++++++++++++++++++++++++------ src/PIP_Tree.defs.hh | 7 ++++++- 7 files changed, 91 insertions(+), 16 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=6af59504…

1 0

[GIT] ppl/ppl(pip): Switched the default cut generation strategy to first row.
by François Galea 13 Nov '09

13 Nov '09

Module: ppl/ppl Branch: pip Commit: 129b74f12cf5069f0f24ed3d48ae26e13f2474c9 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=129b74f12cf5… Author: François Galea <francois.galea(a)uvsq.fr> Date: Fri Nov 13 19:12:50 2009 +0100 Switched the default cut generation strategy to first row. --- demos/ppl_pips/ppl_pips.cc | 6 +++--- src/PIP_Problem.cc | 2 +- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/demos/ppl_pips/ppl_pips.cc b/demos/ppl_pips/ppl_pips.cc index 997df16..3cecd4f 100644 --- a/demos/ppl_pips/ppl_pips.cc +++ b/demos/ppl_pips/ppl_pips.cc @@ -106,7 +106,7 @@ ppl_set_GMP_memory_allocation_functions(void) { namespace { PPL::PIP_Problem_Control_Parameter_Value cutting_strategy - = PPL::PIP_CUTTING_STRATEGY_DEEPEST; + = PPL::PIP_CUTTING_STRATEGY_FIRST; void pip_display_sol(std::ostream& out, @@ -464,8 +464,8 @@ static const char* usage_string " -cPATH, --check=PATH checks if the result is equal to what is in PATH\n" #endif "\nCut generation options:\n" -" -d, --deepest try to generate the deepest cut (default)\n" -" -f, --first use the first non-integer row\n" +" -f, --first use the first non-integer row (default)\n" +" -d, --deepest try to generate the deepest cut\n" #ifndef PPL_HAVE_GETOPT_H "\n" "NOTE: this version does not support long options.\n" diff --git a/src/PIP_Problem.cc b/src/PIP_Problem.cc index afb3984..ef641ed 100644 --- a/src/PIP_Problem.cc +++ b/src/PIP_Problem.cc @@ -73,7 +73,7 @@ PPL::PIP_Problem::~PIP_Problem() { void PPL::PIP_Problem::control_parameters_init() { - control_parameters[PIP_CUTTING_STRATEGY] = PIP_CUTTING_STRATEGY_DEEPEST; + control_parameters[PIP_CUTTING_STRATEGY] = PIP_CUTTING_STRATEGY_FIRST; } void

1 0

[GIT] ppl/ppl(pip): Fixed a bug.
by François Galea 13 Nov '09

13 Nov '09

Module: ppl/ppl Branch: pip Commit: 60731ffcf53aac457ffefb82f312ee503d69f766 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=60731ffcf53a… Author: François Galea <francois.galea(a)uvsq.fr> Date: Fri Nov 13 18:19:01 2009 +0100 Fixed a bug. --- src/PIP_Problem.cc | 7 ++++--- 1 files changed, 4 insertions(+), 3 deletions(-) diff --git a/src/PIP_Problem.cc b/src/PIP_Problem.cc index 84544d7..afb3984 100644 --- a/src/PIP_Problem.cc +++ b/src/PIP_Problem.cc @@ -236,10 +236,11 @@ PPL::PIP_Problem::OK() const { if (strategy < PIP_CUTTING_STRATEGY_FIRST || strategy > PIP_CUTTING_STRATEGY_DEEPEST) { #ifndef NDEBUG - cerr << "Invalid value for the PIP_CUTTING_STRATEGY control parameter." - << endl; - ascii_dump(cerr); + cerr << "Invalid value for the PIP_CUTTING_STRATEGY control parameter." + << endl; + ascii_dump(cerr); #endif + return false; } if (!parameters.OK())

1 0

[GIT] ppl/ppl(pip): Added a control parameter for cut generation strategy.
by François Galea 13 Nov '09

13 Nov '09

Module: ppl/ppl Branch: pip Commit: 3a6efe8316708d58e15c9912ce65ef84df005601 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=3a6efe831670… Author: François Galea <francois.galea(a)uvsq.fr> Date: Fri Nov 13 17:10:40 2009 +0100 Added a control parameter for cut generation strategy. --- demos/ppl_pips/ppl_pips.cc | 19 ++++++++++++- src/PIP_Problem.cc | 32 ++++++++++++++++++++++- src/PIP_Problem.defs.hh | 1 + src/PIP_Problem.types.hh | 8 ++++++ src/PIP_Tree.cc | 60 ++++++++++++++++++++++++------------------- 5 files changed, 89 insertions(+), 31 deletions(-) diff --git a/demos/ppl_pips/ppl_pips.cc b/demos/ppl_pips/ppl_pips.cc index b7f7a4e..997df16 100644 --- a/demos/ppl_pips/ppl_pips.cc +++ b/demos/ppl_pips/ppl_pips.cc @@ -105,6 +105,9 @@ ppl_set_GMP_memory_allocation_functions(void) { namespace { +PPL::PIP_Problem_Control_Parameter_Value cutting_strategy + = PPL::PIP_CUTTING_STRATEGY_DEEPEST; + void pip_display_sol(std::ostream& out, const Parma_Polyhedra_Library::PIP_Tree pip, @@ -168,6 +171,7 @@ pip_display_sol(std::ostream& out, class PIP_Parser { public: PIP_Parser() : pip() { + pip.set_control_parameter(PPL::PIP_CUTTING_STRATEGY, cutting_strategy); } virtual ~PIP_Parser() { @@ -459,6 +463,9 @@ static const char* usage_string " -V, --version prints version information to stdout\n" " -cPATH, --check=PATH checks if the result is equal to what is in PATH\n" #endif +"\nCut generation options:\n" +" -d, --deepest try to generate the deepest cut (default)\n" +" -f, --first use the first non-integer row\n" #ifndef PPL_HAVE_GETOPT_H "\n" "NOTE: this version does not support long options.\n" @@ -467,9 +474,9 @@ static const char* usage_string "Report bugs to <ppl-devel(a)cs.unipr.it>.\n"; #if defined(USE_PPL) -#define OPTION_LETTERS "R:ho:PptvVc:" +#define OPTION_LETTERS "R:ho:PptvVc:df" #else -#define OPTION_LETTERS "R:ho:Pptv" +#define OPTION_LETTERS "R:ho:Pptvdf" #endif const char* program_name = 0; @@ -660,6 +667,14 @@ process_options(int argc, char* argv[]) { #endif + case 'd': + cutting_strategy = PPL::PIP_CUTTING_STRATEGY_DEEPEST; + break; + + case 'f': + cutting_strategy = PPL::PIP_CUTTING_STRATEGY_FIRST; + break; + default: abort(); } diff --git a/src/PIP_Problem.cc b/src/PIP_Problem.cc index b495d62..84544d7 100644 --- a/src/PIP_Problem.cc +++ b/src/PIP_Problem.cc @@ -73,6 +73,7 @@ PPL::PIP_Problem::~PIP_Problem() { void PPL::PIP_Problem::control_parameters_init() { + control_parameters[PIP_CUTTING_STRATEGY] = PIP_CUTTING_STRATEGY_DEEPEST; } void @@ -230,6 +231,16 @@ PPL::PIP_Problem::OK() const { } // Test validity of control parameter values. + PIP_Problem_Control_Parameter_Value strategy + = control_parameters[PIP_CUTTING_STRATEGY]; + if (strategy < PIP_CUTTING_STRATEGY_FIRST + || strategy > PIP_CUTTING_STRATEGY_DEEPEST) { +#ifndef NDEBUG + cerr << "Invalid value for the PIP_CUTTING_STRATEGY control parameter." + << endl; + ascii_dump(cerr); +#endif + } if (!parameters.OK()) return false; @@ -284,6 +295,12 @@ PPL::PIP_Problem::ascii_dump(std::ostream& s) const { for (dimension_type i=0; i<PIP_PROBLEM_CONTROL_PARAMETER_NAME_SIZE; ++i) { PIP_Problem_Control_Parameter_Value value = control_parameters[i]; switch (value) { + case PIP_CUTTING_STRATEGY_FIRST: + s << "PIP_CUTTING_STRATEGY_FIRST"; + break; + case PIP_CUTTING_STRATEGY_DEEPEST: + s << "PIP_CUTTING_STRATEGY_DEEPEST"; + break; default: s << "Invalid control parameter value"; } @@ -379,8 +396,11 @@ PPL::PIP_Problem::ascii_load(std::istream& s) { if (!(s >> str)) return false; PIP_Problem_Control_Parameter_Value value; - // set of if / else if string comparisons to get the correct value - // else + if (str == "PIP_CUTTING_STRATEGY_FIRST") + value = PIP_CUTTING_STRATEGY_FIRST; + if (str == "PIP_CUTTING_STRATEGY_DEEPEST") + value = PIP_CUTTING_STRATEGY_DEEPEST; + else return false; control_parameters[i] = value; } @@ -501,6 +521,14 @@ void PPL::PIP_Problem::set_control_parameter(PIP_Problem_Control_Parameter_Name n, PIP_Problem_Control_Parameter_Value v) { switch (n) { + case PIP_CUTTING_STRATEGY: + if (v != PIP_CUTTING_STRATEGY_FIRST && v != PIP_CUTTING_STRATEGY_DEEPEST) + throw std::invalid_argument("PPL::PIP_Problem::set_control_parameter" + "(n,v):\ninvalid value for n. " + "Valid choices are " + "PIP_CUTTING_STRATEGY_FIRST or" + "PIP_CUTTING_STRATEGY_DEEPEST."); + break; default: throw std::invalid_argument("PPL::PIP_Problem::set_control_parameter(n,v)" ":\ninvalid value for n."); diff --git a/src/PIP_Problem.defs.hh b/src/PIP_Problem.defs.hh index de455b6..9ff18ee 100644 --- a/src/PIP_Problem.defs.hh +++ b/src/PIP_Problem.defs.hh @@ -83,6 +83,7 @@ operator<<(std::ostream& s, const PIP_Problem& p); the change of objective function and the change of optimization mode. */ class Parma_Polyhedra_Library::PIP_Problem { + friend class PIP_Solution_Node; public: //! Builds a trivial PIP problem. /*! diff --git a/src/PIP_Problem.types.hh b/src/PIP_Problem.types.hh index 85f1484..b981e3e 100644 --- a/src/PIP_Problem.types.hh +++ b/src/PIP_Problem.types.hh @@ -28,6 +28,9 @@ enum PIP_Problem_Status { //! Possible name values for PIP_Problem control parameters. /*! \ingroup PPL_CXX_interface */ enum PIP_Problem_Control_Parameter_Name { + //! Cutting strategy + PIP_CUTTING_STRATEGY, + /*! Number of different possible values of PIP_Problem_Control_Parameter_Name enumeration. */ PIP_PROBLEM_CONTROL_PARAMETER_NAME_SIZE @@ -36,6 +39,11 @@ enum PIP_Problem_Control_Parameter_Name { //! Possible values for PIP_Problem control parameters. /*! \ingroup PPL_CXX_interface */ enum PIP_Problem_Control_Parameter_Value { + //! Choose the first non-integer row + PIP_CUTTING_STRATEGY_FIRST, + //! Choose row which generates the deepest cut + PIP_CUTTING_STRATEGY_DEEPEST, + /*! Number of different possible values of PIP_Problem_Control_Parameter_Value enumeration. */ PIP_PROBLEM_CONTROL_PARAMETER_VALUE_SIZE diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 98827ed..d7263f4 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -22,6 +22,7 @@ site: http://www.cs.unipr.it/ppl/ . */ #include <ppl-config.h> #include "PIP_Tree.defs.hh" +#include "PIP_Problem.defs.hh" #include <algorithm> @@ -1515,36 +1516,41 @@ PIP_Solution_Node::solve(PIP_Tree_Node*& parent_ref, } else { /* The solution is non-integer. We have to generate a cut. */ - - /* Look for row which will generate the "deepest" cut */ - PPL_DIRTY_TEMP_COEFFICIENT(score); - PPL_DIRTY_TEMP_COEFFICIENT(score1); - PPL_DIRTY_TEMP_COEFFICIENT(score2); PPL_DIRTY_TEMP_COEFFICIENT(mod); - Coefficient best = 0; - dimension_type best_i = 0; - for (i_ = 0; i_ < num_rows; ++i_) { - const Row& row_t = tableau.t[i_]; - const Row& row_s = tableau.s[i_]; - score1 = 0; - for (j = 0; j < num_params; ++j) { - mod_assign(mod, row_t[j], d); - if (mod != 0) - score1 += d - mod; - } - score2 = 0; - for (j = 0; j < num_vars; ++j) { - mod_assign(mod, row_s[j], d); - if (mod != 0) - score2 += d - mod; - } - score = score1*score2; - if (score > best) { - best = score; - best_i = i_; + if (problem.control_parameters[PIP_CUTTING_STRATEGY] + == PIP_CUTTING_STRATEGY_FIRST) { + /* Just choose the row corresponding to variable i */ + i = mapping[i]; + } else /* PIP_CUTTING_STRATEGY_DEEPEST */ { + /* Look for the row which will generate the "deepest" cut */ + PPL_DIRTY_TEMP_COEFFICIENT(score); + PPL_DIRTY_TEMP_COEFFICIENT(score1); + PPL_DIRTY_TEMP_COEFFICIENT(score2); + Coefficient best = 0; + dimension_type best_i = 0; + for (i_ = 0; i_ < num_rows; ++i_) { + const Row& row_t = tableau.t[i_]; + const Row& row_s = tableau.s[i_]; + score1 = 0; + for (j = 0; j < num_params; ++j) { + mod_assign(mod, row_t[j], d); + if (mod != 0) + score1 += d - mod; + } + score2 = 0; + for (j = 0; j < num_vars; ++j) { + mod_assign(mod, row_s[j], d); + if (mod != 0) + score2 += d - mod; + } + score = score1*score2; + if (score > best) { + best = score; + best_i = i_; + } } + i = best_i; } - i = best_i; #ifdef NOISY_PIP std::cout << "Row " << i << " contains non-integer coefficients. "

1 0

[GIT] ppl/ppl(pip): Added a mechanism for setting/ getting control parameter values.
by François Galea 13 Nov '09

13 Nov '09

Module: ppl/ppl Branch: pip Commit: d105f5ecbaaf8cbc75676e74c0adab53a377e114 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d105f5ecbaaf… Author: François Galea <francois.galea(a)uvsq.fr> Date: Tue Nov 10 16:08:43 2009 +0100 Added a mechanism for setting/getting control parameter values. --- src/PIP_Problem.cc | 53 +++++++++++++++++++++++++++++++++++++++++- src/PIP_Problem.defs.hh | 18 +++++++++++++- src/PIP_Problem.inlines.hh | 7 +++++ src/PIP_Problem.templates.hh | 1 + src/PIP_Problem.types.hh | 18 ++++++++++++++ src/PIP_Tree.cc | 30 +++++++++++++++-------- src/PIP_Tree.defs.hh | 30 +++++++++++++++++++++-- 7 files changed, 141 insertions(+), 16 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=d105f5ec…

1 0

[GIT] ppl/ppl(pip): Made use of virtual methods in PIP_Tree_Node::clone().
by François Galea 13 Nov '09

13 Nov '09

Module: ppl/ppl Branch: pip Commit: da5f1817645d61f8b0f89d474d4006f8d244e1c2 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=da5f1817645d… Author: François Galea <francois.galea(a)uvsq.fr> Date: Tue Nov 10 16:07:17 2009 +0100 Made use of virtual methods in PIP_Tree_Node::clone(). --- src/PIP_Tree.cc | 13 +------------ src/PIP_Tree.defs.hh | 6 +++--- 2 files changed, 4 insertions(+), 15 deletions(-) diff --git a/src/PIP_Tree.cc b/src/PIP_Tree.cc index 24cc78b..cd985bf 100644 --- a/src/PIP_Tree.cc +++ b/src/PIP_Tree.cc @@ -624,22 +624,11 @@ PIP_Tree_Node::ascii_load(std::istream& s) { } PIP_Tree_Node* -PIP_Tree_Node::clone() const { - const PIP_Solution_Node* as_s = as_solution(); - if (as_s != 0) - return as_s->clone(); - const PIP_Decision_Node* as_d = as_decision(); - if (as_d != 0) - return as_d->clone(); - return 0; -} - -PIP_Solution_Node* PIP_Solution_Node::clone() const { return new PIP_Solution_Node(*this); } -PIP_Decision_Node* +PIP_Tree_Node* PIP_Decision_Node::clone() const { return new PIP_Decision_Node(*this); } diff --git a/src/PIP_Tree.defs.hh b/src/PIP_Tree.defs.hh index 5711c8f..f0b4046 100644 --- a/src/PIP_Tree.defs.hh +++ b/src/PIP_Tree.defs.hh @@ -132,7 +132,7 @@ public: bool ascii_load(std::istream& s); //! Returns a pointer to a dynamically-allocated copy of \p *this. - PIP_Tree_Node* clone() const; + virtual PIP_Tree_Node* clone() const = 0; protected: //! Default constructor. @@ -245,7 +245,7 @@ public: bool ascii_load(std::istream& s); //! Returns a pointer to a dynamically-allocated copy of \p *this. - PIP_Solution_Node* clone() const; + virtual PIP_Tree_Node* clone() const; bool OK() const; @@ -475,7 +475,7 @@ public: PIP_Tree_Node* child_node(bool v); //! Returns a pointer to a dynamically-allocated copy of \p *this. - PIP_Decision_Node* clone() const; + virtual PIP_Tree_Node* clone() const; bool OK() const;

1 0

[GIT] ppl/w3ppl(master): Updated Pat's home page.
by Roberto Bagnara 13 Nov '09

13 Nov '09

Module: ppl/w3ppl Branch: master Commit: 31508eeda0c31d39daf63c8b667c3f761737d5b2 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=31508eeda0… Author: Roberto Bagnara <bagnara(a)cs.unipr.it> Date: Fri Nov 13 08:30:17 2009 +0100 Updated Pat's home page. --- htdocs/About/About.raw | 6 +++--- htdocs/Contribute/Contribute.raw | 2 +- htdocs/Credits/Credits.raw | 4 ++-- htdocs/seminars_2003_2004.raw | 2 +- 4 files changed, 7 insertions(+), 7 deletions(-) diff --git a/htdocs/About/About.raw b/htdocs/About/About.raw index d79c341..cb8c39e 100644 --- a/htdocs/About/About.raw +++ b/htdocs/About/About.raw @@ -68,7 +68,7 @@ She worked on the documentation of the library. Since the beginning of June 2001 -<A HREF="http://www.comp.leeds.ac.uk/hill/">Patricia M. Hill</A> +<A HREF="http://www.cs.unipr.it/~hill/">Patricia M. Hill</A> joined the effort and has been, since then, part of the stable development team. @@ -178,7 +178,7 @@ releases of the library. After investigating previous work on a domain called Z-polyhedra [<A HREF="@BASE_DIR@Documentation/bibliography#Ancourt91th">Anc91</A>], -<A HREF = "http://www.comp.leeds.ac.uk/hill/">Pat Hill</A> +<A HREF = "http://www.cs.unipr.it/~hill/">Patricia Hill</A> began a project aimed at the development of a domain of grids, a generalization of the well-known lattice domain. @@ -187,7 +187,7 @@ In October 2003, <A HREF = "http://www.comp.leeds.ac.uk/katyd/">Katy Dobson</A> started work as a research student at the University of Leeds under the supervision of -<A HREF = "http://www.comp.leeds.ac.uk/hill/">Pat Hill</A> +<A HREF = "http://www.cs.unipr.it/~hill/">Patricia Hill</A> to work on the representation of the Grid Domain and algorithms needed for the main operators on this domain. diff --git a/htdocs/Contribute/Contribute.raw b/htdocs/Contribute/Contribute.raw index bb0cbf7..dc18070 100644 --- a/htdocs/Contribute/Contribute.raw +++ b/htdocs/Contribute/Contribute.raw @@ -188,7 +188,7 @@ progetto a Leeds sotto la direzione di Patricia Hill (vedi oltre). 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.comp.leeds.ac.uk/hill/">Patricia M. Hill</A>. +<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 Erasmus link between the Universities of diff --git a/htdocs/Credits/Credits.raw b/htdocs/Credits/Credits.raw index 1994a42..a824435 100644 --- a/htdocs/Credits/Credits.raw +++ b/htdocs/Credits/Credits.raw @@ -20,8 +20,8 @@ maintained and improved by the following people: (University of Parma) </LI> <LI> - <A HREF="http://www.comp.leeds.ac.uk/hill/">Patricia M. Hill</A> - (University of Leeds) + <A HREF="http://www.cs.unipr.it/~hill/">Patricia M. Hill</A> + (University of Parma) </LI> <LI> <A HREF="http://www.cs.unipr.it/~zaffanella/">Enea Zaffanella</A> diff --git a/htdocs/seminars_2003_2004.raw b/htdocs/seminars_2003_2004.raw index 34f41af..5eda361 100644 --- a/htdocs/seminars_2003_2004.raw +++ b/htdocs/seminars_2003_2004.raw @@ -61,7 +61,7 @@ Convexity Recognition of the Union of Polyhedra</A>. <DT>November 19, 2003</DT> <DD> -<A HREF="http://www.comp.leeds.ac.uk/hill/"> +<A HREF="http://www.cs.unipr.it/~hill/"> Dr. Patricia M. Hill</A> <A HREF="http://www.cs.unipr.it/Seminars/2003/PMHill20031119"> Discrete Numerical Domains for the Analysis of Software</A>.

1 0

PPL Java interface on windows
by Krzysztof Jakubczyk 11 Nov '09

11 Nov '09

Hello, my goal is to use PPL library on windows though Java interface. The problem is I must have all library files to successfully load it using Java loadlibrary or load calls. I've successfully compiled PPL using cygwin but failed to use the Java interface - my Java hangs on loadlibrary call with one of cygwin dlls. My second attempt was to use MinGW to compile PPL. The problem is that compilation fails on demos\ppl_lcdd\ppl_lcdd.cc - problems with sys/resource.h which is not present in MinGW. Is it possible to compile PPL on windows using MinGW to output dll files that can be used by Java interface? (possibly also gmp dll file?)

1 0