- PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(bounded_arithmetic): Fixed noisy output.
by Alberto Gioia 07 Jul '11

07 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 1dd5888b9a8011279e1caf76c49f990f9e59108f URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=1dd5888b9a80… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Thu Jul 7 17:50:59 2011 +0200 Fixed noisy output. --- tests/Concrete_Expression/linearize_int.cc | 330 +++++++++++++--------------- 1 files changed, 156 insertions(+), 174 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=1dd5888b…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Fixed bitwise functions.
by Alberto Gioia 07 Jul '11

07 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 278e38a3ad8616c33c6c73b1088a105d64029ed8 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=278e38a3ad86… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Thu Jul 7 17:48:46 2011 +0200 Fixed bitwise functions. --- src/Linear_Form.templates.hh | 121 +++++++++++++++++++++++------------------- 1 files changed, 67 insertions(+), 54 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=278e38a3…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Fixed functions lshift_assign and rshift_assign.
by Alberto Gioia 07 Jul '11

07 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: d8fca333c422bb111a15b8c812341f8eb0ffc65d URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d8fca333c422… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Thu Jul 7 17:46:53 2011 +0200 Fixed functions lshift_assign and rshift_assign. --- src/Interval.inlines.hh | 28 ++++++++++++++-------------- 1 files changed, 14 insertions(+), 14 deletions(-) diff --git a/src/Interval.inlines.hh b/src/Interval.inlines.hh index af1a146..402d815 100644 --- a/src/Interval.inlines.hh +++ b/src/Interval.inlines.hh @@ -1107,7 +1107,7 @@ Interval<To_Boundary, To_Info>::lshift_assign(const From1& x, const From2& y) { } } /* xls >= 0, yus < 0 - 0 <= x << y <= x/(2^y) + 0 <= x << y <= x/(2^|y|) */ else if (yus < 0 ) { @@ -1128,10 +1128,10 @@ Interval<To_Boundary, To_Info>::lshift_assign(const From1& x, const From2& y) { else if (xus < 0 ) { Boundary_NS::assign(UPPER, upper() , to_info, - UPPER, f_upper(Constant<-1>::value), - f_info(Constant<-1>::value)); + UPPER, f_upper(Constant<0>::value), + f_info(Constant<0>::value)); /* xus < 0, yls >= 0 - x*(2^y) <= x << y <= -1 + x*(2^y) <= x << y <= 0 */ if(yls >= 0) { mpz_class tmp_exp((int)ldexp(1.0, f_lower(y))); @@ -1147,7 +1147,7 @@ Interval<To_Boundary, To_Info>::lshift_assign(const From1& x, const From2& y) { } } /* xus < 0, yus < 0 - x/(2^y) <= x << y <= -1 + x/(2^|y|) <= x << y <= 0 */ else if (yus < 0) { @@ -1165,8 +1165,8 @@ Interval<To_Boundary, To_Info>::lshift_assign(const From1& x, const From2& y) { UPPER, f_upper(y), f_info(y)); if (lower() > -1) Boundary_NS::assign(LOWER, lower(), to_info, - LOWER, f_lower(Constant<-1>::value), - f_info(Constant<-1>::value)); + LOWER, f_lower(Constant<0>::value), + f_info(Constant<0>::value)); } @@ -1209,7 +1209,7 @@ Interval<To_Boundary, To_Info>::rshift_assign(const From1& x, const From2& y) { else if (yus < 0) { /* xls >= 0, yus < 0 - 0 <= x >> y <= x*(2^y) + 0 <= x >> y <= x*(2^|y|) */ PPL_DIRTY_TEMP(To_Boundary, tmp_upper); PPL_DIRTY_TEMP(To_Info, tmp_info); @@ -1228,26 +1228,26 @@ Interval<To_Boundary, To_Info>::rshift_assign(const From1& x, const From2& y) { else if (xus < 0) { Boundary_NS::assign(UPPER, upper() , to_info, - UPPER, f_upper(Constant<-1>::value), - f_info(Constant<-1>::value)); + UPPER, f_upper(Constant<0>::value), + f_info(Constant<0>::value)); if(yls >= 0) { /* xls < 0, yus >= 0 - x/(2^y) <= x >> y <= -1 + x/(2^y) <= x >> y <= 0 */ Boundary_NS::div_assign(LOWER, lower(), to_info, LOWER, f_lower(x), f_info(x), LOWER, f_lower(y), f_info(y)); if (lower() > -1) Boundary_NS::assign(LOWER, lower(), to_info, - LOWER, f_lower(Constant<-1>::value), - f_info(Constant<-1>::value)); + LOWER, f_lower(Constant<0>::value), + f_info(Constant<0>::value)); } else if (yus < 0) { /* xus < 0, yus < 0 - x*(2^y) <= x >> y <= -1 + x*(2^|y|) <= x >> y <= 0 */ PPL_DIRTY_TEMP(To_Boundary, tmp_lower); PPL_DIRTY_TEMP(To_Info, tmp_info);

1 0

[GIT] ppl/ppl(bounded_arithmetic): Corrected documentation.
by Alberto Gioia 07 Jul '11

07 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: d3a4393da2940e2ab9fe2af718aecb7de6dda2f7 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d3a4393da294… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Thu Jul 7 17:41:12 2011 +0200 Corrected documentation. --- doc/definitions.dox | 28 +++++++++++++------------- src/linearize_integer.hh | 48 +++++++++++++++++++++++----------------------- 2 files changed, 38 insertions(+), 38 deletions(-) diff --git a/doc/definitions.dox b/doc/definitions.dox index 9b997ed..8735398 100644 --- a/doc/definitions.dox +++ b/doc/definitions.dox @@ -2858,9 +2858,9 @@ The interval bitwise operators are defined as follow: \left[a,b\right] \olessthan ^{\#} \left[a',b'\right] \approx \begin{cases} \left[0, \left(b \amifp 2^{b'}\right)\right] & \mbox{if }a \geq 0\mbox{ and } a' \geq 0 \\ - \left[0, \left(b \adivifp 2^{b'}\right)\right] & \mbox{if }a \geq 0\mbox{ and } b' \le 0 \\ - \left[\left(a \amifp 2^{a'}\right), -1\right] & \mbox{if }b \le 0\mbox{ and } a' \geq 0 \\ - \left[\left(a \adivifp 2^{a'}\right), -1\right] & \mbox{if }b \le 0\mbox{ and } b' \le 0 \\ + \left[0, \left(b \adivifp 2^{\left|b'\right|}\right)\right] & \mbox{if }a \geq 0\mbox{ and } b' \le 0 \\ + \left[\left(a \amifp 2^{a'}\right), 0\right] & \mbox{if }b \le 0\mbox{ and } a' \geq 0 \\ + \left[\left(a \adivifp 2^{\left|a'\right|}\right), 0\right] & \mbox{if }b \le 0\mbox{ and } b' \le 0 \\ \end{cases} @@ -2872,9 +2872,9 @@ The interval bitwise operators are defined as follow: \left[a,b\right] \ogreaterthan ^{\#} \left[a',b'\right] \approx \begin{cases} \left[0, \left(b \adivifp 2^{b'}\right)\right] & \mbox{if }a \geq 0\mbox{ and } a' \geq 0 \\ - \left[0, \left(b \amifp 2^{b'}\right)\right] & \mbox{if }a \geq 0\mbox{ and } b' \le 0 \\ - \left[\left(a \adivifp 2^{a'}\right), -1\right] & \mbox{if }b \le 0\mbox{ and } a' \geq 0 \\ - \left[\left(a \amifp 2^{a'}\right), -1\right] & \mbox{if }b \le 0\mbox{ and } b' \le 0 \\ + \left[0, \left(b \amifp 2^{\left|b'\right|}\right)\right] & \mbox{if }a \geq 0\mbox{ and } b' \le 0 \\ + \left[\left(a \adivifp 2^{a'}\right), 0\right] & \mbox{if }b \le 0\mbox{ and } a' \geq 0 \\ + \left[\left(a \amifp 2^{\left|a'\right|}\right), 0\right] & \mbox{if }b \le 0\mbox{ and } b' \le 0 \\ \end{cases} @@ -3101,7 +3101,7 @@ have discordand signs, with the first greater than or equal zero, then \leq \left(i + \sum_{v \in \cV}i_{v}v \right) \adivlf - 2^{\left(i' + \sum_{v \in \cV}i'_{v}v \right)} + 2^{\left(\left|i'\right| + \sum_{v \in \cV}\left|i'_{v}\right|v \right)} \f] @@ -3117,7 +3117,7 @@ have discordand signs, with the first less than zero, then \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq - -1 + 0 \f] @@ -3128,11 +3128,11 @@ both less than zero, then \f$k + \sum_{v \in V}k_{v}v\f$ is approximated by: \left(i + \sum_{v \in \cV}i_{v}v \right) \adivlf - 2^{\left(i' + \sum_{v \in \cV}i'_{v}v \right)} + 2^{\left(\left|i'\right| + \sum_{v \in \cV}\left|i'_{v}\right|v \right)} \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq - -1 + 0 \f] @@ -3176,7 +3176,7 @@ have discordand signs, with the first greater than or equal zero, then \leq \left(i + \sum_{v \in \cV}i_{v}v \right) \amlf - 2^{\left(i' + \sum_{v \in \cV}i'_{v}v \right)} + 2^{\left(\left|i'\right| + \sum_{v \in \cV}\left|i'_{v}\right|v \right)} \f] @@ -3192,7 +3192,7 @@ have discordand signs, with the first less than zero, then \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq - -1 + 0 \f] Finally, if \f$i + \sum_{v \in V}i_{v}v\f$ and \f$i' + \sum_{v \in V}i'_{v}v\f$ are @@ -3202,11 +3202,11 @@ both less than zero, then \f$k + \sum_{v \in V}k_{v}v\f$ is approximated by: \left(i + \sum_{v \in \cV}i_{v}v \right) \amlf - 2^{\left(i' + \sum_{v \in \cV}i'_{v}v \right)} + 2^{\left(\left|i'\right| + \sum_{v \in \cV}\left|i'_{v}\right|v \right)} \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq - -1 + 0 \f] diff --git a/src/linearize_integer.hh b/src/linearize_integer.hh index 1b6a9de..1a0f625 100644 --- a/src/linearize_integer.hh +++ b/src/linearize_integer.hh @@ -1413,7 +1413,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \leq x \ll y \leq - -1 + 0 \f] Then let \f$i + \sum_{v \in \cV}i_{v}v \f$ and @@ -1438,7 +1438,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq - -1 + 0 \f] and we can define the elments of the linear form @@ -1449,7 +1449,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \leq k \leq - -1 + 0 \f] \f[ @@ -1457,7 +1457,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \leq k_{v} \leq - -1 + 0 \f] then @@ -1467,7 +1467,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \approx \left(i \amifp 2^{i'} \right) \bowtie - -1 + 0 \f] \f[ @@ -1475,7 +1475,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \approx \left(i_{v} \amifp 2^{i'_{v}} \right) \bowtie - -1 + 0 \f] Finally, let \f$x\f$ and \f$y\f$ be two integer constants both less then zero, @@ -1486,7 +1486,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \leq x \ll y \leq - -1 + 0 \f] Then let \f$i + \sum_{v \in \cV}i_{v}v \f$ and @@ -1511,7 +1511,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq - -1 + 0 \f] and we can define the elments of the linear form @@ -1522,7 +1522,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \leq k \leq - -1 + 0 \f] \f[ @@ -1530,7 +1530,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \leq k_{v} \leq - -1 + 0 \f] then @@ -1540,7 +1540,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \approx \left(i \adivifp 2^{i'} \right) \bowtie - -1 + 0 \f] \f[ @@ -1548,7 +1548,7 @@ xor_linearize_int(const Binary_Operator<Target>& bop_expr, \approx \left(i_{v} \adivifp 2^{i'_{v}} \right) \bowtie - -1 + 0 \f] Given an expression \f$e_{1} \leftslice e_{2}\f$ and a composite @@ -1769,7 +1769,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \leq x \gg y \leq - -1 + 0 \f] Then let \f$i + \sum_{v \in \cV}i_{v}v \f$ and @@ -1794,7 +1794,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq - -1 + 0 \f] and we can define the elments of the linear form @@ -1805,7 +1805,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \leq k \leq - -1 + 0 \f] \f[ @@ -1813,7 +1813,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \leq k_{v} \leq - -1 + 0 \f] then @@ -1823,7 +1823,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \approx \left(i \adivifp 2^{i'} \right) \bowtie - -1 + 0 \f] \f[ @@ -1831,7 +1831,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \approx \left(i_{v} \adivifp 2^{i'_{v}} \right) \bowtie - -1 + 0 \f] Finally, let \f$x\f$ and \f$y\f$ be two integer constants both less @@ -1842,7 +1842,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \leq x \gg y \leq - -1 + 0 \f] Then let \f$i + \sum_{v \in \cV}i_{v}v \f$ and @@ -1867,7 +1867,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \leq \left(k + \sum_{v \in \cV}k_{v}v \right) \leq - -1 + 0 \f] and we can define the elments of the linear form @@ -1878,7 +1878,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \leq k \leq - -1 + 0 \f] \f[ @@ -1886,7 +1886,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \leq k_{v} \leq - -1 + 0 \f] then @@ -1896,7 +1896,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \approx \left(i \amifp 2^{i'} \right) \bowtie - -1 + 0 \f] \f[ @@ -1904,7 +1904,7 @@ lshift_linearize_int(const Binary_Operator<Target>& bop_expr, \approx \left(i_{v} \amifp 2^{i'_{v}} \right) \bowtie - -1 + 0 \f] Given an expression \f$e_{1} \rightslice e_{2}\f$ and a composite

1 0

[GIT] ppl/ppl(bounded_arithmetic): Added documentation on Bitwise operators .
by Alberto Gioia 05 Jul '11

05 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 572a074935fdf80b394a5242f42f9615dbd74ca7 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=572a074935fd… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Tue Jul 5 19:34:27 2011 +0200 Added documentation on Bitwise operators. --- doc/definitions.dox | 448 +++++++++++++++++++++++++++++++++++++++++++++++++++ 1 files changed, 448 insertions(+), 0 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=572a0749…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Adjust the formatting code.
by Alberto Gioia 05 Jul '11

05 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 16f869f5e2cd4fe65b58696e195a8739372f0fd0 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=16f869f5e2cd… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Tue Jul 5 19:33:39 2011 +0200 Adjust the formatting code. --- src/Interval.inlines.hh | 138 ++++++++++++++++++++++++++--------------------- 1 files changed, 76 insertions(+), 62 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=16f869f5…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Adjust the formatting code and renamed variables.
by Alberto Gioia 05 Jul '11

05 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 55e5b617cbdca1b35f39d9dc7aaf90aa5aede471 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=55e5b617cbdc… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Tue Jul 5 19:32:36 2011 +0200 Adjust the formatting code and renamed variables. --- tests/Concrete_Expression/linearize.cc | 1 + tests/Concrete_Expression/linearize_int.cc | 551 ++++++++++++++++++---------- 2 files changed, 363 insertions(+), 189 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=55e5b617…

1 0

[GIT] ppl/ppl(bounded_arithmetic): Added new commands for bitwise operators on intervals and Linear Form.
by Alberto Gioia 05 Jul '11

05 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: d93a15655944a7245e50387a1fe65a4f1ccc15b8 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=d93a15655944… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Tue Jul 5 19:29:01 2011 +0200 Added new commands for bitwise operators on intervals and Linear Form. --- doc/ppl.sty | 16 ++++++++++++++++ 1 files changed, 16 insertions(+), 0 deletions(-) diff --git a/doc/ppl.sty b/doc/ppl.sty index 37f673a..c124981 100644 --- a/doc/ppl.sty +++ b/doc/ppl.sty @@ -198,3 +198,19 @@ \newcommand*{\amlf}{\boxtimes^{\#}} \newcommand*{\linexpr}[1]{\llparenthesis #1 \rrparenthesis} \newcommand*{\linexprenv}[3]{\llparenthesis #1 \rrparenthesis \left \llbracket #2, #3 \right \rrbracket} + +% Interval integer bitwise + +\newcommand*{\bandii}{\owedge^{\#}} +\newcommand*{\borii}{\ovee^{\#}} +\newcommand*{\bxorii}{\dot{\ovee}^{\#}} +\newcommand*{\blshiftii}{\olessthen^{\#}} +\newcommand*{\brshiftii}{\ogreaterthen^{\#}} + +% Linear form bitwise + +\newcommand*{\bandlf}{\fbox{\small{\&}}^{\#}} +\newcommand*{\borlf}{\boxbar^{\#}} +\newcommand*{\bxorlf}{\fbox{\char`\^}^{\#}} +\newcommand*{\blshiftlf}{\leftslice^{\#}} +\newcommand*{\brshiftlf}{\rightslice^{\#}}

1 0

[GIT] ppl/ppl(bounded_arithmetic): Included pah src/linearize_integer. hh for documentation generation.
by Alberto Gioia 05 Jul '11

05 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: 532f232e7c879cbc1ab780b5559e3e1beeae9cf2 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=532f232e7c87… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Tue Jul 5 19:27:01 2011 +0200 Included pah src/linearize_integer.hh for documentation generation. --- doc/devref.doxyconf-html.in | 1 + doc/devref.doxyconf-latex.in | 1 + 2 files changed, 2 insertions(+), 0 deletions(-) diff --git a/doc/devref.doxyconf-html.in b/doc/devref.doxyconf-html.in index 99bfb68..15ae304 100644 --- a/doc/devref.doxyconf-html.in +++ b/doc/devref.doxyconf-html.in @@ -385,6 +385,7 @@ INPUT = @srcdir@/definitions.dox \ @srcdir@/../src/Linear_Form.templates.hh \ @srcdir@/../src/Linear_Form.cc \ @srcdir@/../src/linearize.hh \ + @srcdir@/../src/linearize_integer.hh \ @srcdir@/gpl.dox \ @srcdir@/fdl.dox INPUT_ENCODING = UTF-8 diff --git a/doc/devref.doxyconf-latex.in b/doc/devref.doxyconf-latex.in index 014bc16..678e40a 100644 --- a/doc/devref.doxyconf-latex.in +++ b/doc/devref.doxyconf-latex.in @@ -383,6 +383,7 @@ INPUT = @srcdir@/definitions.dox \ @srcdir@/../src/Linear_Form.templates.hh \ @srcdir@/../src/Linear_Form.cc \ @srcdir@/../src/linearize.hh \ + @srcdir@/../src/linearize_integer.hh \ @srcdir@/gpl.dox \ @srcdir@/fdl.dox INPUT_ENCODING = UTF-8

1 0

[GIT] ppl/ppl(bounded_arithmetic): Moved file in src/
by Alberto Gioia 05 Jul '11

05 Jul '11

Module: ppl/ppl Branch: bounded_arithmetic Commit: fa131235889a699346a30e4dae70f9d1e1202ae1 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=fa131235889a… Author: Alberto Gioia <alberto.gioia1(a)studenti.unipr.it> Date: Tue Jul 5 19:25:29 2011 +0200 Moved file in src/ --- src/linearize_integer.hh | 2066 ++++++++++++++++++++++++ tests/Concrete_Expression/linearize_integer.hh | 377 ----- 2 files changed, 2066 insertions(+), 377 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=fa131235…

1 0