- PPL-devel - BUGSENG Mailman

[GIT] ppl/ppl(master): Updated.
by Roberto Bagnara 28 Oct '13

28 Oct '13

Module: ppl/ppl Branch: master Commit: 8391990970df4c26d8bccc9ad41d68beaea99f50 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=8391990970df… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Mon Oct 28 09:19:59 2013 +0100 Updated. --- NEWS | 4 +++- 1 files changed, 3 insertions(+), 1 deletions(-) diff --git a/NEWS b/NEWS index 2b035af..3fc1d9b 100644 --- a/NEWS +++ b/NEWS @@ -9,12 +9,14 @@ Parma Polyhedra Library NEWS -- history of user-visible changes =============================================================== -------------------------------------------------------------------------- -NEWS for version 1.1 (released date to be decided) +NEWS for version 1.1 (released on October 28, 2013) -------------------------------------------------------------------------- New and Changed Features ======================== +o Added a new operator on polyhedra: the positive time elapse. + o In the Java language interface: - The constraint/generator/... system classes now extend the ArrayList

1 0

[GIT] ppl/ppl(master): Updated.
by Roberto Bagnara 28 Oct '13

28 Oct '13

Module: ppl/ppl Branch: master Commit: f993d2f43436194cbf417c1c976f307298ae152a URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=f993d2f43436… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Mon Oct 28 09:19:35 2013 +0100 Updated. --- ChangeLog | 2673 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 files changed, 2673 insertions(+), 0 deletions(-) Diff: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commitdiff;h=f993d2f4…

1 0

[GIT] ppl/ppl(master): Label updated.
by Roberto Bagnara 28 Oct '13

28 Oct '13

Module: ppl/ppl Branch: master Commit: 346cfc0d619893a05f79da7d53e454f556da5c6b URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=346cfc0d6198… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Mon Oct 28 09:04:37 2013 +0100 Label updated. --- doc/definitions.dox | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/doc/definitions.dox b/doc/definitions.dox index eae3ce5..6565e52 100644 --- a/doc/definitions.dox +++ b/doc/definitions.dox @@ -1586,7 +1586,7 @@ Note that the above set might not be an NNC polyhedron. \subsection Positive_Time_Elapse_Operator Positive Time-Elapse Operator The positive time-elapse operator has been defined in -\ref BFM11 "[BFM11,BFM12]". +\ref BFM11 "[BFM11,BFM13]". The operator provided by the library works on NNC polyhedra. For any two NNC polyhedra \f$\cP, \cQ \in \Pset_n\f$, the positive time-elapse between \f$\cP\f$ and \f$\cQ\f$, denoted \f$ \cP

1 0

[GIT] ppl/ppl(master): BenerecettiFM13 has been published.
by Roberto Bagnara 28 Oct '13

28 Oct '13

Module: ppl/ppl Branch: master Commit: 81b01e9b60766bec50569a1ef68dc22d70de0a65 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=81b01e9b6076… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Mon Oct 28 09:03:22 2013 +0100 BenerecettiFM13 has been published. --- doc/definitions.dox | 45 ++++++++++++++++++++++++--------------------- doc/ppl.bib | 26 ++++++++++++++++++++++++-- 2 files changed, 48 insertions(+), 23 deletions(-) diff --git a/doc/definitions.dox b/doc/definitions.dox index b5c6007..eae3ce5 100644 --- a/doc/definitions.dox +++ b/doc/definitions.dox @@ -3070,6 +3070,30 @@ R. Bagnara, K. Dobson, P. M. Hill, M. Mundell, and E. Z </DD> +<DT>[BFM11]</DT> +<DD> +\anchor BFM11 +M. Benerecetti, M. Faella, and S. Minopoli. + Towards efficient exact synthesis for linear hybrid systems. + In Proceedings of 2nd International Symposium on Games, + Automata, Logics and Formal Verification (GandALF 2011), volume 54 of + Electronic Proceedings in Theoretical Computer Science, pages 263-277, + Minori, Amalfi Coast, Italy, 2011. + +</DD> + + +<DT>[BFM13]</DT> +<DD> +\anchor BFM13 +M. Benerecetti, M. Faella, and S. Minopoli. + Automatic synthesis of switching controllers for linear hybrid + systems: Safety control. + Theoretical Computer Science, 493:116-138, 2013. + +</DD> + + <DT>[BFT00]</DT> <DD> \anchor BFT00 @@ -3542,27 +3566,6 @@ R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill. </DD> -<DT>[BFM11]</DT> -<DD> -\anchor BFM11 -M. Benerecetti, M. Faella, and S. Minopoli. - Towards efficient exact synthesis for Linear Hybrid Systems. - In Proceedings of the 2nd International Symposium on Games, - Automata, Logics and Formal Verification (GandALF 2011), - volume 54 of Electronic Proceedings in Theoretical Computer Science, - pages 263-277. -</DD> - - -<DT>[BFM12]</DT> -<DD> -\anchor BFM12 -M. Benerecetti, M. Faella, and S. Minopoli. - Automatic synthesis of switching controllers for Linear Hybrid Systems: safety control. - Theoretical Computer Science, Elsevier. To appear. -</DD> - - <DT>[CC76]</DT> <DD> \anchor CC76 diff --git a/doc/ppl.bib b/doc/ppl.bib index 02d4d18..cbb16bb 100644 --- a/doc/ppl.bib +++ b/doc/ppl.bib @@ -1249,12 +1249,34 @@ Summarizing: top of the tool PHAVer." } -@Article{BenerecettiFM12, +@Article{BenerecettiFM13, Author = "M. Benerecetti and M. Faella and S. Minopoli", Title = "Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Safety Control", Journal = "Theoretical Computer Science", + Volume = 493, + Pages = "116--138", Publisher = "Elsevier", - Notes = "To appear" + Year = 2013, + Abstract = "In this paper we study the problem of automatically + generating switching controllers for the class of Linear + Hybrid Automata, with respect to safety + objectives. While the same problem has been already + considered in the literature, no sound and complete + solution has been provided so far. We identify and solve + inaccuracies contained in previous characterizations of + the problem, providing a sound and complete symbolic + fixpoint procedure to compute the set of states from + which a controller can keep the system in a given set of + desired states. While the overall procedure may not + terminate, we prove the termination of each iteration, + thus paving the way to an effective implementation. The + techniques needed to effectively and efficiently + implement the proposed solution procedure, based on + polyhedral abstractions of the state space, are + thoroughly illustrated and discussed. Finally, some + supporting and promising experimental results, based on + the implementation of the proposed techniques on top of + the tool PHAVer, are presented." } @InProceedings{BessonJT99,

1 0

[GIT] ppl/ppl(master): Updated.
by Roberto Bagnara 28 Oct '13

28 Oct '13

Module: ppl/ppl Branch: master Commit: 24bf4c88063cbf59eac24068dcc2601e6e42981d URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=24bf4c88063c… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Mon Oct 28 08:52:27 2013 +0100 Updated. --- demos/ppl_lcdd/ppl_lcdd.1 | 4 ++-- demos/ppl_lpsol/ppl_lpsol.1 | 4 ++-- demos/ppl_pips/ppl_pips.1 | 4 ++-- doc/ppl-config.1 | 4 ++-- 4 files changed, 8 insertions(+), 8 deletions(-) diff --git a/demos/ppl_lcdd/ppl_lcdd.1 b/demos/ppl_lcdd/ppl_lcdd.1 index 7a8bf46..ff895ef 100644 --- a/demos/ppl_lcdd/ppl_lcdd.1 +++ b/demos/ppl_lcdd/ppl_lcdd.1 @@ -1,5 +1,5 @@ -.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.4. -.TH PPL_LCDD "1" "June 2012" "ppl_lcdd 1.0" "User Commands" +.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.11. +.TH PPL_LCDD "1" "October 2013" "ppl_lcdd 1.1" "User Commands" .SH NAME ppl_lcdd \- a PPL-based program for vertex/facet enumeration of convex polyhedra .SH SYNOPSIS diff --git a/demos/ppl_lpsol/ppl_lpsol.1 b/demos/ppl_lpsol/ppl_lpsol.1 index 8b0044f..039821d 100644 --- a/demos/ppl_lpsol/ppl_lpsol.1 +++ b/demos/ppl_lpsol/ppl_lpsol.1 @@ -1,5 +1,5 @@ -.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.4. -.TH PPL_LPSOL "1" "June 2012" "ppl_lpsol 1.0" "User Commands" +.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.11. +.TH PPL_LPSOL "1" "October 2013" "ppl_lpsol 1.1" "User Commands" .SH NAME ppl_lpsol \- a PPL-based mixed integer programming problem solver .SH SYNOPSIS diff --git a/demos/ppl_pips/ppl_pips.1 b/demos/ppl_pips/ppl_pips.1 index da2b2ea..c15f2d2 100644 --- a/demos/ppl_pips/ppl_pips.1 +++ b/demos/ppl_pips/ppl_pips.1 @@ -1,5 +1,5 @@ -.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.4. -.TH PPL_PIPS "1" "June 2012" "ppl_pips 1.0" "User Commands" +.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.11. +.TH PPL_PIPS "1" "October 2013" "ppl_pips 1.1" "User Commands" .SH NAME ppl_pips \- a PPL-based parametric integer programming problem solver .SH SYNOPSIS diff --git a/doc/ppl-config.1 b/doc/ppl-config.1 index d03caac..92d7d49 100644 --- a/doc/ppl-config.1 +++ b/doc/ppl-config.1 @@ -1,5 +1,5 @@ -.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.4. -.TH PPL-CONFIG "1" "June 2012" "ppl-config 1.0" "User Commands" +.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.11. +.TH PPL-CONFIG "1" "October 2013" "ppl-config 1.1" "User Commands" .SH NAME ppl-config \- obtain information about an installation of the Parma Polyhedra Library .SH SYNOPSIS

1 0

[GIT] ppl/ppl(master): Test renamed.
by Roberto Bagnara 28 Oct '13

28 Oct '13

Module: ppl/ppl Branch: master Commit: 31307ffe3548b6b6d62554ee2d2ada0b3c168c80 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=31307ffe3548… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Mon Oct 28 08:48:24 2013 +0100 Test renamed. --- tests/Polyhedron/Makefile.am | 4 +++- .../{postimeelapse1.cc => nncpostimeelapse1.cc} | 0 2 files changed, 3 insertions(+), 1 deletions(-) diff --git a/tests/Polyhedron/Makefile.am b/tests/Polyhedron/Makefile.am index c400ffc..b328c53 100644 --- a/tests/Polyhedron/Makefile.am +++ b/tests/Polyhedron/Makefile.am @@ -115,13 +115,13 @@ memory2 \ minconstraints1 minconstraints2 \ mingenerators1 mingenerators2 \ nncminimize1 nncminimize2 \ +nncpostimeelapse1 \ numberinput1 \ onepoint \ permute \ polydifference1 polydifference2 \ polyhull1 polyhull2 \ polyhullifexact1 polyhullifexact2 \ -postimeelapse1 \ randphull1 \ refinewithcongruence1 \ refinewithcongruences1 \ @@ -376,6 +376,8 @@ numberinput1_SOURCES = numberinput1.cc nncminimize1_SOURCES = nncminimize1.cc nncminimize2_SOURCES = nncminimize2.cc +nncpostimeelapse1_SOURCES = nncpostimeelapse1.cc + onepoint_SOURCES = onepoint.cc permute_SOURCES = permute.cc diff --git a/tests/Polyhedron/postimeelapse1.cc b/tests/Polyhedron/nncpostimeelapse1.cc similarity index 100% rename from tests/Polyhedron/postimeelapse1.cc rename to tests/Polyhedron/nncpostimeelapse1.cc

1 0

[GIT] ppl/ppl(master): Improved.
by Roberto Bagnara 28 Oct '13

28 Oct '13

Module: ppl/ppl Branch: master Commit: 1b2d7f553fd8910db6b419d0012b9595d8220ea6 URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=1b2d7f553fd8… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Mon Oct 28 08:43:44 2013 +0100 Improved. --- tests/Polyhedron/postimeelapse1.cc | 51 +++++++++++++++++++----------------- 1 files changed, 27 insertions(+), 24 deletions(-) diff --git a/tests/Polyhedron/postimeelapse1.cc b/tests/Polyhedron/postimeelapse1.cc index d4b8ce2..b6d4048 100644 --- a/tests/Polyhedron/postimeelapse1.cc +++ b/tests/Polyhedron/postimeelapse1.cc @@ -115,7 +115,7 @@ test03() { known_result.add_constraint(y <= 1); bool ok = (ph1 == known_result); - + print_generators(ph1, "*** ph1_positive_time_elapse_assign(ph2) ***"); return ok; @@ -150,11 +150,11 @@ test04() { known_result.add_constraint(y <= 1); bool ok = (ph1 == known_result); - + return ok; } -// Positive time elapse between: true and a point +// Positive time elapse between the universe and a point. bool test05() { Variable x(0); @@ -176,11 +176,11 @@ test05() { NNC_Polyhedron known_result(2); bool ok = (ph1 == known_result); - + return ok; } -// Positive time elapse between: a point and true +// Positive time elapse between a point and the universe. bool test06() { Variable x(0); @@ -205,7 +205,8 @@ test06() { return ok; } -// Positive time elapse between: two rational points with different denominators +// Positive time elapse between two rational points with different +// denominators. bool test07() { Variable x(0); @@ -233,7 +234,7 @@ test07() { } -// Positive time elapse between: Polyhedra with two different dimension +// Positive time elapse between Polyhedra with two different dimensions. bool test08() { Variable x(0); @@ -250,7 +251,7 @@ test08() { print_constraints(ph2, "*** ph2 ***"); bool known_result = false; - + try { ph1.positive_time_elapse_assign(ph2); @@ -260,13 +261,14 @@ test08() { { known_result=true; } - + bool ok = (known_result == true); return ok; } -// Positive time elapse between: two zero-dimensional polyhedra where the second one is EMPTY +// Positive time elapse between two zero-dimensional polyhedra where +// the second one is empty. bool test09() { Variable x(0); @@ -287,7 +289,7 @@ test09() { return ok; } -// Positive time elapse between: a polyhedron and FALSE (the empty polyhedron) +// Positive time elapse between a polyhedron and the empty polyhedron. bool test10() { Variable x(0); @@ -310,7 +312,7 @@ test10() { return ok; } -// Positive time elapse between: FALSE and a polyhedron +// Positive time elapse between the empty polyhedron and another polyhedron. bool test11() { Variable x(0); @@ -333,29 +335,29 @@ test11() { return ok; } -// Positive time elapse between: an empty polyhedron with non-processed pending constraints -// and a normal polyhedron +// Positive time elapse between an empty polyhedron with non-processed +// pending constraints and a normal polyhedron. bool test12() { Variable x(0); Variable y(1); - + NNC_Polyhedron ph1(2); ph1.add_constraint(x >= 255); ph1.add_constraint(x <= 257); ph1.add_constraint(y >= 255); ph1.add_constraint(y <= 257); - + Variables_Set vars(x, y); - // Defines constraints of an EMPTY Polyhedron + // Defines constraints of an empty polyhedron. Constraint_System cs; cs.insert(x > y); cs.insert(x < y); - // Adding pending constraints + // Adding pending constraints. ph1.wrap_assign(vars, BITS_8, UNSIGNED, OVERFLOW_WRAPS, &cs, 16, false); - + NNC_Polyhedron ph2(2); ph2.add_constraint(x > 0); ph2.add_constraint(y > 1); @@ -371,12 +373,13 @@ test12() { return ok; } -// Positive time elapse between: a normal polyhedron and an empty polyhedron with non-processed pending constraints +// Positive time elapse between a normal polyhedron and an empty +// polyhedron with non-processed pending constraints. bool test13() { Variable x(0); Variable y(1); - + NNC_Polyhedron ph1(2); ph1.add_constraint(x > 0); ph1.add_constraint(y > 1); @@ -386,17 +389,17 @@ test13() { ph2.add_constraint(x <= 257); ph2.add_constraint(y >= 255); ph2.add_constraint(y <= 257); - + Variables_Set vars(x, y); // Defines constraints of an EMPTY Polyhedron Constraint_System cs; cs.insert(x > y); cs.insert(x < y); - + // Adding pending constraints ph2.wrap_assign(vars, BITS_8, UNSIGNED, OVERFLOW_WRAPS, &cs, 16, true); - + ph1.positive_time_elapse_assign(ph2); print_constraints(ph1, "*** ph1 ***");

1 0

[GIT] ppl/ppl(master): Version number bumped.
by Roberto Bagnara 28 Oct '13

28 Oct '13

Module: ppl/ppl Branch: master Commit: c0c660fe771942d58dd8834eccb04346dec9be3a URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=c0c660fe7719… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Mon Oct 28 08:05:05 2013 +0100 Version number bumped. --- configure.ac | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/configure.ac b/configure.ac index 25ffd0c..39ade54 100644 --- a/configure.ac +++ b/configure.ac @@ -24,7 +24,7 @@ # Process this file with Autoconf to produce a configure script. # Every other copy of the package version number gets its value from here. -AC_INIT([the Parma Polyhedra Library], [1.1pre13], [ppl-devel(a)cs.unipr.it], [ppl]) +AC_INIT([the Parma Polyhedra Library], [1.1pre14], [ppl-devel(a)cs.unipr.it], [ppl]) # Minimum Autoconf version required. AC_PREREQ(2.61)

1 0

[GIT] ppl/ppl(master): Fixed a bug.
by Patricia Hill 27 Oct '13

27 Oct '13

Module: ppl/ppl Branch: master Commit: c4307aa10c9496e4b21f9520820c17c9706b0afa URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=c4307aa10c94… Author: Patricia Hill <patricia.hill(a)bugseng.com> Date: Sun Oct 27 21:20:15 2013 +0000 Fixed a bug. --- ...l_interface_generator_java_classes_java_code.m4 | 4 ++-- ...erface_generator_common_procedure_generators.m4 | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 b/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 index 9c74d98..8bdf04b 100644 --- a/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 +++ b/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 @@ -337,11 +337,11 @@ ___BEGIN_OF_FILE___ @CLASS@.java << ___END_OF_FILE___ ') -m4_define(`ppl_@TOPOLOGY@@CLASS@_positive_time_elapse_assign_code', +m4_define(`ppl_@CLASS@_positive_time_elapse_assign_code', `dnl ___END_OF_FILE___ ___BEGIN_OF_FILE___ @TOPOLOGY@@CLASS@.java << ___END_OF_FILE___ - public native void positive_time_elapse_assign(@CLASS@ p); + public native void positive_time_elapse_assign(@TOPOLOGY@@CLASS@ p); ') diff --git a/interfaces/ppl_interface_generator_common_procedure_generators.m4 b/interfaces/ppl_interface_generator_common_procedure_generators.m4 index d6c4e28..0d0d226 100644 --- a/interfaces/ppl_interface_generator_common_procedure_generators.m4 +++ b/interfaces/ppl_interface_generator_common_procedure_generators.m4 @@ -75,8 +75,8 @@ ppl_@CLASS@_add_@CLASS_REPRESENT@s/2 *nofail +all, ppl_@CLASS@_refine_with_@REFINE_REPRESENT@/2 *nofail +all, ppl_@CLASS@_refine_with_@REFINE_REPRESENT@s/2 *nofail +all, ppl_@CLASS@_@BINOP@/2 *nofail +all, -ppl_@CLASS@_positive_time_elapse_assign/2 *nofail +polyhedron, ppl_@CLASS@_@UB_EXACT@/2 +all, +ppl_@CLASS@_positive_time_elapse_assign/2 *nofail +polyhedron, ppl_@CLASS@_simplify_using_context_assign/3 +simple_pps, ppl_@CLASS@_constrains/2 +all, ppl_@CLASS@_unconstrain_space_dimension/2 +all,

1 0

[GIT] ppl/ppl(master): A couple of corrections.
by Roberto Bagnara 27 Oct '13

27 Oct '13

Module: ppl/ppl Branch: master Commit: 36781bcd0c14d4549fc685f52ce244cd83004a7b URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=36781bcd0c14… Author: Roberto Bagnara <roberto.bagnara(a)bugseng.com> Date: Sun Oct 27 20:41:26 2013 +0100 A couple of corrections. --- ...ppl_interface_generator_java_classes_cc_code.m4 | 2 +- ...l_interface_generator_java_classes_java_code.m4 | 4 ++-- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_code.m4 b/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_code.m4 index 694e400..875936e 100644 --- a/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_code.m4 +++ b/interfaces/Java/jni/ppl_interface_generator_java_classes_cc_code.m4 @@ -781,7 +781,7 @@ CATCH_ALL m4_define(`ppl_@CLASS@_positive_time_elapse_assign_code', `dnl JNIEXPORT void JNICALL -Java_parma_1polyhedra_1library_@1TOPOLOGY@@1CLASS@_positive_time_elapse_assign +Java_parma_1polyhedra_1library_@1TOPOLOGY@@1CLASS@_positive_1time_1elapse_1assign (JNIEnv* env, jobject j_this, jobject j_y) try { @TOPOLOGY@@CPP_CLASS@* this_ptr = reinterpret_cast<@TOPOLOGY@@CPP_CLASS@*>(get_ptr(env, j_this)); diff --git a/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 b/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 index 952d803..9c74d98 100644 --- a/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 +++ b/interfaces/Java/parma_polyhedra_library/ppl_interface_generator_java_classes_java_code.m4 @@ -337,10 +337,10 @@ ___BEGIN_OF_FILE___ @CLASS@.java << ___END_OF_FILE___ ') -m4_define(`ppl_@CLASS@_positive_time_elapse_assign_code', +m4_define(`ppl_@TOPOLOGY@@CLASS@_positive_time_elapse_assign_code', `dnl ___END_OF_FILE___ -___BEGIN_OF_FILE___ @CLASS@.java << ___END_OF_FILE___ +___BEGIN_OF_FILE___ @TOPOLOGY@@CLASS@.java << ___END_OF_FILE___ public native void positive_time_elapse_assign(@CLASS@ p); ')

1 0