problems installing ppl-0.[78] with sicstus on amd64
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi! We are trying to use PPL for finite domain solving of non-linear constraints in our research project. Unfortunately, on our computing server (4x Opteron 848) we cannot get PPL to install. I have attached the output of "make install" to this mail. There seems to be a problem with linking to sicstus. If you have any ideas how to resolve this issue we would be very glad. Also, if you just have some pointers where to look for the problem we also would greatly appreciate that information. We really need to get PPL working! Kind regards, Peter - -- Peter Schneider-Kamp mailto:psk@informatik.rwth-aachen.de LuFG Informatik II http://www-i2.informatik.rwth-aachen.de/~nowonder RWTH Aachen phone: ++49 241 80-21211 -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.2 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFD1kkS3VbrCXkKHhwRAmQpAJwPmnRwp8UEj8Pgo+IDwNna40ep+ACcCvJL aefKWkHYZc/PMBc3Wqc2mY4= =HY4x -----END PGP SIGNATURE-----
Peter Schneider-Kamp wrote:
We are trying to use PPL for finite domain solving of non-linear constraints in our research project.
Unfortunately, on our computing server (4x Opteron 848) we cannot get PPL to install.
I have attached the output of "make install" to this mail. There seems to be a problem with linking to sicstus.
If you have any ideas how to resolve this issue we would be very glad. Also, if you just have some pointers where to look for the problem we also would greatly appreciate that information. We really need to get PPL working!
Dear Peter, we have succeeded in reproducing the problem you report. Can you please test the attached patch? Please let us know how it goes. All the best, Roberto P.S. Are you using the PPL for termination analysis? And how do you use it with non-linear constraints? Just curious... -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it Index: interfaces/Prolog/SICStus/Makefile.am =================================================================== RCS file: /cvs/ppl/ppl/interfaces/Prolog/SICStus/Makefile.am,v retrieving revision 1.63 diff -c -d -u -r1.63 Makefile.am cvs diff: conflicting specifications of output style --- interfaces/Prolog/SICStus/Makefile.am 13 Jan 2006 17:19:24 -0000 1.63 +++ interfaces/Prolog/SICStus/Makefile.am 25 Jan 2006 12:33:38 -0000 @@ -54,12 +54,12 @@ $(top_builddir)/Watchdog/src/libpwl.la \ @extra_libraries@ -ppl_sicstus.s.o: ppl_sicstus.pl ppl_sicstus_sd.o | ppl_sicstus_sd.la - splfr --static $(srcdir)/ppl_sicstus.pl ppl_sicstus_sd.o +ppl_sicstus.s.o: ppl_sicstus.pl .libs/ppl_sicstus_sd.o | ppl_sicstus_sd.la + splfr --static $(srcdir)/ppl_sicstus.pl .libs/ppl_sicstus_sd.o -ppl_sicstus.so: ppl_sicstus.pl ppl_sicstus_sd.o $(top_builddir)/src/libppl.la $(top_builddir)/Watchdog/src/libpwl.la | ppl_sicstus_sd.la +ppl_sicstus.so: ppl_sicstus.pl .libs/ppl_sicstus_sd.o $(top_builddir)/src/libppl.la $(top_builddir)/Watchdog/src/libpwl.la | ppl_sicstus_sd.la $(LIBTOOL) --mode=link --tag=CXX \ - splfr $(srcdir)/ppl_sicstus.pl ppl_sicstus_sd.o -o $@ \ + splfr $(srcdir)/ppl_sicstus.pl .libs/ppl_sicstus_sd.o -o $@ \ $(top_builddir)/src/libppl.la \ $(top_builddir)/Watchdog/src/libpwl.la \ @extra_libraries@
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Dear Roberto, thanks for your quick help! This indeed solved our problem. Right now we are using ppl with cTI to compare our Prolog termination analysis to that of cTI. We actually had to resort back to ppl 0.6 because there seems to have been a change in the interface used by cTI. Are there many drawbacks when using 0.6 compared to 0.8? The speedup from SICStus clpq to ppl is up to 50000 times. Very impressive. So, for fair evaluation we needed to get ppl to perform. For our own termination analyser we indeed do not know how to use it (yet). The finite domain constraints we have to solve are inherently non-linear. Do you have any ideas/pointers how one can deal with non-linear constraints? Can ppl handle some kinds of non-linearism? Kind regards, Peter Roberto Bagnara wrote:
Peter Schneider-Kamp wrote:
We are trying to use PPL for finite domain solving of non-linear constraints in our research project.
Unfortunately, on our computing server (4x Opteron 848) we cannot get PPL to install.
I have attached the output of "make install" to this mail. There seems to be a problem with linking to sicstus.
If you have any ideas how to resolve this issue we would be very glad. Also, if you just have some pointers where to look for the problem we also would greatly appreciate that information. We really need to get PPL working!
Dear Peter,
we have succeeded in reproducing the problem you report. Can you please test the attached patch? Please let us know how it goes. All the best,
Roberto
P.S. Are you using the PPL for termination analysis? And how do you use it with non-linear constraints? Just curious...
-----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.2 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFD15ut3VbrCXkKHhwRAqw4AJ4npeqNyi5cwjN1gD+IrkW3iKquvACdGFV0 0FvJJetQPLWjNZoYyGSz27A= =nK6r -----END PGP SIGNATURE-----
Peter Schneider-Kamp wrote:
thanks for your quick help! This indeed solved our problem.
Good!
Right now we are using ppl with cTI to compare our Prolog termination analysis to that of cTI. We actually had to resort back to ppl 0.6 because there seems to have been a change in the interface used by cTI. Are there many drawbacks when using 0.6 compared to 0.8?
You should definitely use PPL 0.8. You will find a pre-release of cTI 1.1 in ftp://ftp.cs.unipr.it/pub/cTI/snapshots/cTI-1.1pre1.tar.gz This supports (actually, it requires) PPL 0.8. Please, let us know if it works for you.
The speedup from SICStus clpq to ppl is up to 50000 times. Very impressive. So, for fair evaluation we needed to get ppl to perform.
I understand.
For our own termination analyser we indeed do not know how to use it (yet). The finite domain constraints we have to solve are inherently non-linear. Do you have any ideas/pointers how one can deal with non-linear constraints?
Can you tell us more about these constraints? There are many different ways of giving up linearity.
Can ppl handle some kinds of non-linearism?
PPL 0.8 offers the Polyhedra_Powerset construction, which you can instantiate over general (not necessarily closed) convex polyhedra and bounded-difference shapes. Our experiments on powersets of bounded-difference shapes shows that this domain has very good scalability on the problem of deriving inter-argument size relations for Prolog programs (i.e., the analysis terminates in reasonable time for all the Prolog programs in the China benchmark suite, and this includes several "monsters"). Since yesterday, the CVS HEAD version of the PPL offers a domain of rational grids (see http://www.cs.unipr.it/ppl/abstractions). As far as we know, this is the first time a _complete_ domain of rational grids (e.g., with a provably correct widening operator) is made available to the public. (Of course, the Grid domain can be the argument of the Polyhedra_Powerset construction.) Another way the PPL can be used for the analysis of non-linear relations is by translation of systems of (low-degree) polynomial constraint inequalities to convex polyhedra. Some preliminary results are reported in the [BRCZ05a] and [BRCZ05b] items of http://www.cs.unipr.it/ppl/Documentation/citations If you can give us more details about your constraints, we will try to be helpful. 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
participants (2)
-
Peter Schneider-Kamp -
Roberto Bagnara