February 2004 - PPL-devel - BUGSENG Mailman

w3ppl/htdocs/Credits Credits.raw
by Roberto Bagnara 14 Feb '04

14 Feb '04

CVSROOT: /cvs/ppl Module name: w3ppl Changes by: roberto(a)cs.unipr.it 2004-02-14 15:20:01 Modified files: htdocs/Credits : Credits.raw Log message: Updated. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/w3ppl/htdocs/Credits/Credits.raw.…

1 0

[Fwd: Re: [PPL-devel] Compiling PPL under Cygwin?]
by Roberto Bagnara 13 Feb '04

13 Feb '04

-------- Original Message -------- Subject: Re: [PPL-devel] Compiling PPL under Cygwin? Date: Wed, 11 Feb 2004 18:43:52 +0000 From: Goran Frehse <gfrehse(a)andrew.cmu.edu> To: Roberto Bagnara <bagnara(a)cs.unipr.it> References: <402A51EB.60609(a)andrew.cmu.edu> <402AA44B.2010702(a)cs.unipr.it> Roberto Bagnara wrote: > I assume the library that could not be found is `libstdc++.la', > not `libstc++.la'. If so, this is the standard C++ library and > should have been installed along with g++ on your installation. Yes, you are right. Actually I just noticed that somebody answered my request in the Cygwin mailing list about this. It turns out that the paths in the .la files are wrong and must be corrected by hand in the current installation. For details, see: http://cygwin.com/ml/cygwin/2004-02/msg00304.html > during the weekend. Meanwhile, a few questions: (1) which version of > the PPL are you trying to compile? (2) Which version of Cygwin > are you using (if you use the updater http://sources.redhat.com/cygwin/ > then we are using the same version)? (3) Did you compile GMP yourself > and, if so, how did you configure it? (1) 0.5 (2) 1.5.7-1, a fresh download from www.cygwin.com last week. (3) GMP was compiled without further options (It installed itself in /usr/local/lib). Note that "make" causes no problems, only "make check". > The problem is that no one in the development team is using (let alone > developing under) Windows, so everything is more difficult. > If you are interested in support for Borland C++ and are willing to > assist us a little bit, then we can revive the efforts of that development > branch. I have the same problem :-) My main platform is Linux and currently I have no other compilers. > I attach the current version of these instructions for the C interface > under the signature. I will draft something for the C++ interface > and let you have it, so that you can suggest improvements and additions. Great. Please know that I'm not trying to cause you work, just trying to be of assistance. It took me a few attempts to get everything to compile under Linux, so a few small comments might help others, too. Best wishes, Goran -- 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

ppl/src Matrix.defs.hh Matrix.inlines.hh
by Roberto Bagnara 12 Feb '04

12 Feb '04

CVSROOT: /cvs/ppl Module name: ppl Changes by: roberto(a)cs.unipr.it 2004-02-12 15:18:10 Modified files: src : Matrix.defs.hh Matrix.inlines.hh Log message: Do not put code into files named *.defs.hh. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Matrix.defs.hh.diff?cvsro… http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Matrix.inlines.hh.diff?cv…

1 0

[Fwd: Re: [PPL-devel] Compiling PPL under Cygwin?]
by Roberto Bagnara 12 Feb '04

12 Feb '04

-- 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

Compiling PPL under Cygwin?
by Goran Frehse 11 Feb '04

11 Feb '04

Hello all, I am currently trying to compile the PPL under Cygwin. While the PPL compiles ok, the tests (make check) fail at the linking stage with an error 'could not find library: ' ... 'libstc++.la'. I tried setting various directories with ./configure, but without success. Are there any successfull attempts to compile under Cygwin that you are aware of? Is there any other way to compile the PPL under Windows? Thanks, Goran Frehse P.S.: I think it's a wonderful library, great job of the development team. A (very) small example and some installation instructions might be nice, just to let people see how to compile and include the PPL. I would be happy to produce one if you are busy. -- Goran Frehse Electrical and Computer Engineering Carnegie Mellon University

2 1

Asking for confirmation: ppl_Polyhedron_add_constraints()
by Hosung Song 11 Feb '04

11 Feb '04

When I add constraint system to polyhedron by ppl_Polyhedron_add_constraings(poly, consys), it looks like consys is cleared to universe. Is this a right behavior? I naively thought the consys would be preserved. Is this related to the recycle issue between ordinary polyhedron instantiation and recycled instantiation? Thanks in advance.

2 2

w3ppl/htdocs/Documentation ppl.bib
by Roberto Bagnara 09 Feb '04

09 Feb '04

CVSROOT: /cvs/ppl Module name: w3ppl Changes by: roberto(a)cs.unipr.it 2004-02-09 15:42:03 Modified files: htdocs/Documentation: ppl.bib Log message: Added Masdupuy92 and Masdupuy93th. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/w3ppl/htdocs/Documentation/ppl.bi…

1 0

Re: [PPL-devel] Re: PPL and parameters
by Roberto Bagnara 09 Feb '04

09 Feb '04

Sven Verdoolaege wrote: >>Am I correct if I say that you are interested in systems >>of what, IIRC, Masdupuy calls "trapezoid congruences", >>where a1, ..., an, l, u are rational numbers and k is a natural? > > > It was just an example. I'm interested in the general case as well. > E.g., (Omega notation) > > {[dm'] : (Exists k': > 32dm' <= 4k'+800j+40000<=32dm'+31 > && 0<=i,j,k<=199 && k<k'<=199 > && (Exists dm: 32dm <= 800k+4i<=32dm+31 && > (Exists x,y: 256x <= dm <= 256x+255 && > 256y<= dm'<=256y+255 && > 0<=dm-256x = dm'-256y<=255)))}; > > I'm not sure if that fits "trapezoid congruences". > I'd have to look at that concept more closely. If you do, please let us know what you concluded. >>@PhDThesis{Masdupuy93th, > > > Do you have an electronic copy of that ? Yes: just sent to your address. All the best, Roberto -- 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

[Fwd: Re: [PPL-devel] Re: PPL and parameters]
by Roberto Bagnara 09 Feb '04

09 Feb '04

-------- Original Message -------- Subject: Re: [PPL-devel] Re: PPL and parameters Date: Mon, 9 Feb 2004 12:48:08 +0100 From: Sven Verdoolaege <skimo(a)kotnet.org> To: Roberto Bagnara <bagnara(a)cs.unipr.it> References: <20040206142357.GK1796(a)greensroom.kotnet.org> <4023E18A.7020208(a)cs.unipr.it> <20040208220817.GD1826(a)greensroom.kotnet.org> <40276EB3.10905(a)cs.unipr.it> On Mon, Feb 09, 2004 at 12:27:47PM +0100, Roberto Bagnara wrote: > Sven Verdoolaege wrote: > > The usual. Existentially quantified variables. > > E.g., { x : \exists a : 4 a + 1 <= x <= 4a + 2 } > > The variable `a' is bound to be an integer, right? Yes. > Am I correct if I say that you are interested in systems > of what, IIRC, Masdupuy calls "trapezoid congruences", > where a1, ..., an, l, u are rational numbers and k is a natural? It was just an example. I'm interested in the general case as well. E.g., (Omega notation) {[dm'] : (Exists k': 32dm' <= 4k'+800j+40000<=32dm'+31 && 0<=i,j,k<=199 && k<k'<=199 && (Exists dm: 32dm <= 800k+4i<=32dm+31 && (Exists x,y: 256x <= dm <= 256x+255 && 256y<= dm'<=256y+255 && 0<=dm-256x = dm'-256y<=255)))}; I'm not sure if that fits "trapezoid congruences". I'd have to look at that concept more closely. > @PhDThesis{Masdupuy93th, Do you have an electronic copy of that ? > Tell them that, for whoever does a nice job on the subject and > is willing to give a seminar, there is a free trip to Parma to > be won :-) I'll keep that in mind. skimo -- 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

Re: PPL and parameters
by Roberto Bagnara 09 Feb '04

09 Feb '04

Sven Verdoolaege wrote: > I'm working on counting the number of points in parametrized polyhedra. > (http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW376.abs.html) > Currently, I'm using PolyLib because I could reuse a lot from the > previous implementation. > > But PolyLib has some problems. > For one, each time a polytope is created, it creates new mpz_ts, > which results in a lot of calls to mpz_init and mpz_clear. > Does PPL handle this differently ? Dear Sven, I am not sure I understand what you mean. The current version of the PPL is also based on GMP (even though we have a development branch to implement support for native integers and other kinds of coefficients, see http://www.cs.unipr.it/pipermail/ppl-devel/2004-February/004115.html). So when you create a polyhedron, new GMP objects will be created. How many of them, depends on the polyhedron. What you can count on is that the PPL uses lazy and incremental computation techniques wherever possible, so that it will not create unnecessary objects (i.e., if the polyhedron being created is "simple", few memory allocation will be required). I realize I am probably not answering your question: if you can be more specific we will do our best. > A quick glance at the documentation suggests that PPL only > supports what Omega would call "set variables". > Are there any plans for supporting parameters and/or > existential variables ? What do you mean by "existential variables"? I think we will support parameterized polyhedra in the future. But this is something that will not happen tomorrow. There is much activity now but the focus is elsewhere at the moment (specialized classes of polyhedra, powersets, different kinds of coefficients, new interfaces, incorporation of the simplex method, even more memory efficiency, improved NNC polyhedra, grids and Z-polyhedra, ...). All the best, Roberto -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it

2 2