November 2001 - PPL-devel - BUGSENG Mailman

ppl/interfaces/Prolog/SICStus clpq.pl
by Patricia Hill 09 Nov '01

09 Nov '01

CVSROOT: /cvs/ppl Module name: ppl Changes by: hill(a)cs.unipr.it 2001-11-09 18:28:48 Modified files: interfaces/Prolog/SICStus: clpq.pl Log message: Now clpq.pl does not require the lists module. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/SICStus/clp…

1 0

ppl/interfaces/Prolog/SICStus clpq.pl
by Patricia Hill 09 Nov '01

09 Nov '01

CVSROOT: /cvs/ppl Module name: ppl Changes by: hill(a)cs.unipr.it 2001-11-09 17:45:49 Modified files: interfaces/Prolog/SICStus: clpq.pl Log message: Now a vertex is inserted before any lines or rays. This avoids a bug when inserting generators into the empty polyhedron. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/SICStus/clp…

1 0

ppl/interfaces/Prolog/SICStus clpq.pl
by Roberto Bagnara 09 Nov '01

09 Nov '01

CVSROOT: /cvs/ppl Module name: ppl Changes by: roberto(a)cs.unipr.it 2001-11-09 16:21:54 Modified files: interfaces/Prolog/SICStus: clpq.pl Log message: Now the interpreter answers "yes" or "no". The listing/0 command has been improved. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/SICStus/clp…

1 0

Performance
by Roberto Bagnara 09 Nov '01

09 Nov '01

For those who care about performance, here is the total time (in seconds) spent by China+PPL to analyze the entire benchmark suite. Each result is prefixed by a date. Those interested can thus see what was the cost of the extra-checks we have added and how we recovered with smarter memory allocation strategies. To get sense of what follows you need to keep an eye on the CVS history, of course. 2001-10-23 3026.66 2001-10-24 2965.83 2001-10-29 3028.75 2001-10-29 2621.58 2001-10-30 2833.64 2001-10-31 2688.87 2001-11-01 2892.96 2001-11-01 2650 2001-11-02 2629.1 2001-11-04 2533.4 2001-11-04 2514.51 2001-11-04 2390.36 2001-11-05 2416.02 2001-11-08 2459.47 2001-11-09 2364.58 -- 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.cc Matrix.defs.hh Polyhedron.cc ...
by Roberto Bagnara 09 Nov '01

09 Nov '01

CVSROOT: /cvs/ppl Module name: ppl Changes by: roberto(a)cs.unipr.it 2001-11-09 15:50:06 Modified files: src : Matrix.cc Matrix.defs.hh Polyhedron.cc Row.cc Row.defs.hh conversion.cc Log message: Another go at smart memory allocation. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Matrix.cc.diff?cvsroot=pp… 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/Polyhedron.cc.diff?cvsroo… http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Row.cc.diff?cvsroot=ppl&r… http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/Row.defs.hh.diff?cvsroot=… http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/src/conversion.cc.diff?cvsroo…

1 0

ppl/tests addconstraints2.cc
by Roberto Bagnara 09 Nov '01

09 Nov '01

CVSROOT: /cvs/ppl Module name: ppl Changes by: roberto(a)cs.unipr.it 2001-11-09 15:49:29 Modified files: tests : addconstraints2.cc Log message: Catch standard exceptions. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/tests/addconstraints2.cc.diff…

1 0

Normalization
by Roberto Bagnara 09 Nov '01

09 Nov '01

Running China+PPL on our benchmark suite I observed the following phenomenon: when the constraints of polyhedra are printed I see, e.g., both B + C + D + E - F = -2, and -B - C - D - E + F = 2. These constraints are equivalent and are also normalized with our current notion of normalization. In fact, gcd(1,-1,-2) = gcd(-1,1,2) = 1. The question is: are we using too weak a notion of normalization? What happens if, for equalities, we insist having a non-negative inhomogeneous term? Notice that, in some places, we are rather syntactic when dealing with constraints. For instance, in Matrix::merge_rows_assign() we regard the above constraints as different and we get them both in the result. Any idea? Ciao, Roberto -- 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/interfaces/Prolog Prolog_interface.dox
by Patricia Hill 09 Nov '01

09 Nov '01

CVSROOT: /cvs/ppl Module name: ppl Changes by: hill(a)cs.unipr.it 2001-11-09 14:22:53 Modified files: interfaces/Prolog: Prolog_interface.dox Log message: Corrections and improvements as suggested by Enea implemented. Other corrections done and examples added. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/Prolog_inte…

1 0

ppl/interfaces/Prolog/SICStus clpq.pl
by Patricia Hill 09 Nov '01

09 Nov '01

CVSROOT: /cvs/ppl Module name: ppl Changes by: hill(a)cs.unipr.it 2001-11-09 13:19:12 Modified files: interfaces/Prolog/SICStus: clpq.pl Log message: Now there are no calls to the ppl_convex_hull_assign operation. This version keeps the list of generators and uses that to recover from failure paths. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/SICStus/clp…

1 0

ppl/interfaces/Prolog/SICStus clpq.pl
by Patricia Hill 09 Nov '01

09 Nov '01

CVSROOT: /cvs/ppl Module name: ppl Changes by: hill(a)cs.unipr.it 2001-11-09 08:48:45 Modified files: interfaces/Prolog/SICStus: clpq.pl Log message: Now many of the unwanted temporary copies of polyhedra are deleted earlier. Patches: http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/ppl/interfaces/Prolog/SICStus/clp…

1 0