{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:46:48Z","timestamp":1762458408160,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,24]],"date-time":"2004-08-24T00:00:00Z","timestamp":1093305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,24]]},"DOI":"10.1145\/1014007.1014022","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"147-158","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Proving termination of membership equational programs"],"prefix":"10.1145","author":[{"given":"Francisco","family":"Dur\u00e1n","sequence":"first","affiliation":[{"name":"Universidad de M\u00e1laga, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[{"name":"Universidad Polit\u00e9cnica de Valencia, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00df","family":"Meseguer","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"March\u00e9","sequence":"additional","affiliation":[{"name":"INRIA Futurs, Universit\u00e9 Paris-Sud, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Urbain","sequence":"additional","affiliation":[{"name":"INRIA Futurs, Universit\u00e9 Paris-Sud, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0541"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00358-9"},{"key":"e_1_3_2_1_3_1","series-title":"LNAI","first-page":"314","volume-title":"Proc. of 18th International Conference on Automated Deduction","author":"Borralleras C.","year":"2002","unstructured":"C. Borralleras , S. Lucas , and A. Rubio . Recursive path orderings can be context-sensitive . In A. Voronkov, editor, Proc. of 18th International Conference on Automated Deduction , volume 2392 of LNAI , pages 314 -- 331 . Springer-Verlag , 2002 .]] C. Borralleras, S. Lucas, and A. Rubio. Recursive path orderings can be context-sensitive. In A. Voronkov, editor, Proc. of 18th International Conference on Automated Deduction, volume 2392 of LNAI, pages 314--331. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_4_1","first-page":"61","volume-title":"Rubio {27}","author":"Borralleras C.","unstructured":"C. Borralleras and A. Rubio . Termptation . In Rubio {27} , pages 61 -- 63 . Technical Report DSIC II\/15\/03, Universidad Polit\u00e9cnica de Valencia, Spain .]] C. Borralleras and A. Rubio. Termptation. In Rubio {27}, pages 61--63. Technical Report DSIC II\/15\/03, Universidad Polit\u00e9cnica de Valencia, Spain.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00206-6"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-45061-0_22","volume-title":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming","author":"Bruni R.","year":"2003","unstructured":"R. Bruni and J. Meseguer . Generalized rewrite theories . In J. Baeten, J. Lenstra, J. Parrow, and G. Woeginger, editors, Proceedings of the 30th International Colloquium on Automata, Languages and Programming , volume 2719 of LNCS , pages 252 -- 266 , 2003 .]] R. Bruni and J. Meseguer. Generalized rewrite theories. In J. Baeten, J. Lenstra, J. Parrow, and G. Woeginger, editors, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, volume 2719 of LNCS, pages 252--266, 2003.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00359-0"},{"key":"e_1_3_2_1_8_1","unstructured":"CoFI Task Group on Semantics. CASL---The common algebraic specification language version 1.0 Semantics. http:\/\/www.brics.dk\/Projects\/CoFI\/Documents\/CASL\/Semantics\/index.html July 1999.]]  CoFI Task Group on Semantics. CASL---The common algebraic specification language version 1.0 Semantics. http:\/\/www.brics.dk\/Projects\/CoFI\/Documents\/CASL\/Semantics\/index.html July 1999.]]"},{"key":"e_1_3_2_1_9_1","unstructured":"E. Contejean C. March\u00e9 B. Monate and X. Urbain. Proving termination of rewriting with CiME. In Rubio {27}. http:\/\/cime.lri.fr.]]  E. Contejean C. March\u00e9 B. Monate and X. Urbain. Proving termination of rewriting with CiME. In Rubio {27}. http:\/\/cime.lri.fr.]]"},{"key":"e_1_3_2_1_10_1","unstructured":"M.\n      Ferreira\n     and \n      A.\n      Ribeiro\n  . \n  Context-sensitive ac-rewriting\n  . In P. Narendran and M. Rusinowitch editors 10th International Conference on Rewriting Techniques and Applications volume \n  1631\n   of \n  LNCS pages \n  286\n  --\n  300 Trento Italy July \n  1999\n  . \n  Springer-Verlag\n  .]]   M. Ferreira and A. Ribeiro. Context-sensitive ac-rewriting. In P. Narendran and M. Rusinowitch editors 10th International Conference on Rewriting Techniques and Applications volume 1631 of LNCS pages 286--300 Trento Italy July 1999. Springer-Verlag.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/571157.571164"},{"key":"e_1_3_2_1_12_1","series-title":"AMAST Series","volume-title":"CafeOBJ Report. World Scientific","author":"Futatsugi K.","year":"1998","unstructured":"K. Futatsugi and R. Diaconescu . CafeOBJ Report. World Scientific , AMAST Series , 1998 .]] K. Futatsugi and R. Diaconescu. CafeOBJ Report. World Scientific, AMAST Series, 1998.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796803004945"},{"key":"e_1_3_2_1_14_1","unstructured":"J. Giesl R. Thiemann P. Schneider-Kamp and S. Falke. AProVE: A system for proving termination. In Rubio {27}. http:\/\/www-i2.informatik.rwth-aachen.de\/AProVE.]]  J. Giesl R. Thiemann P. Schneider-Kamp and S. Falke. AProVE: A system for proving termination. In Rubio {27}. http:\/\/www-i2.informatik.rwth-aachen.de\/AProVE.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6541-0"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"N.\n      Hirokawa\n     and \n      A.\n      Middeldorp\n  . \n  Tsukuba termination tool\n  . In R. Nieuwenhuis editor 14th International Conference on Rewriting Techniques and Applications volume \n  2706\n   of \n  LNCS pages \n  311\n  --\n  320 Valencia Spain June \n  2003\n  . \n  Springer-Verlag\n  .]]   N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In R. Nieuwenhuis editor 14th International Conference on Rewriting Techniques and Applications volume 2706 of LNCS pages 311--320 Valencia Spain June 2003. Springer-Verlag.]]","DOI":"10.1007\/3-540-44881-0_22"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"122","volume-title":"F. M. auf der Heide and B","author":"Lucas S.","year":"1996","unstructured":"S. Lucas . Termination of context-sensitive rewriting by rewriting . In F. M. auf der Heide and B . Monien, editors, Proc. of ICALP'96, volume 1099 of LNCS , pages 122 -- 133 . Springer-Verlag , 1996 .]] S. Lucas. Termination of context-sensitive rewriting by rewriting. In F. M. auf der Heide and B. Monien, editors, Proc. of ICALP'96, volume 1099 of LNCS, pages 122--133. Springer-Verlag, 1996.]]"},{"issue":"1","key":"e_1_3_2_1_18_1","article-title":"Context-sensitive computations in functional and functional logic programs","volume":"1998","author":"Lucas S.","year":"1998","unstructured":"S. Lucas . Context-sensitive computations in functional and functional logic programs . Journal of Functional and Logic Programming , 1998 ( 1 ), January 1998 .]] S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1), January 1998.]]","journal-title":"Journal of Functional and Logic Programming"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(02)93176-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_14"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-540-24727-2_23","volume-title":"Proc. of 7th International Conference on Foundations of Software Science and Computation Structures, FOSSACS'04","author":"Lucas S.","year":"2004","unstructured":"S. Lucas . Polynomials for proving termination of context-sensitive rewriting . In I. Walukiewicz, editor, Proc. of 7th International Conference on Foundations of Software Science and Computation Structures, FOSSACS'04 , volume 2987 of LNCS , pages 318 -- 332 . Springer-Verlag , 2004 .]] S. Lucas. Polynomials for proving termination of context-sensitive rewriting. In I. Walukiewicz, editor, Proc. of 7th International Conference on Foundations of Software Science and Computation Structures, FOSSACS'04, volume 2987 of LNCS, pages 318--332. Springer-Verlag, 2004.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2004.02.003"},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","first-page":"18","volume-title":"F","author":"Meseguer J.","year":"1998","unstructured":"J. Meseguer . Membership algebra as a logical framework for equational specification. In F . Parisi-Presicce, editor, Proceedings WADT'97, volume 1376 of LNCS , pages 18 -- 61 . Springer-Verlag , 1998 .]] J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Proceedings WADT'97, volume 1376 of LNCS, pages 18--61. Springer-Verlag, 1998.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/513717"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00272-7"},{"key":"e_1_3_2_1_27_1","volume-title":"6th International Workshop on Termination, WST'03","author":"Rubio A.","year":"2003","unstructured":"A. Rubio , editor. 6th International Workshop on Termination, WST'03 , June 2003 . Technical Report DSIC II\/15\/03, Universidad Polit\u00e9cnica de Valencia, Spain.]] A. Rubio, editor. 6th International Workshop on Termination, WST'03, June 2003. Technical Report DSIC II\/15\/03, Universidad Polit\u00e9cnica de Valencia, Spain.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"X.\n      Urbain\n    .\n  Automated incremental termination proofs for hierarchically defined term rewriting systems\n  . In R. Gor\u00e9 A. Leitsch and T. Nipkow editors IJCAR'01 volume \n  2083\n   of \n  LNAI pages \n  485\n  --\n  498 Siena Italy June \n  2001\n  . \n  Springer-Verlag\n  .]]   X. Urbain. Automated incremental termination proofs for hierarchically defined term rewriting systems. In R. Gor\u00e9 A. Leitsch and T. Nipkow editors IJCAR'01 volume 2083 of LNAI pages 485--498 Siena Italy June 2001. Springer-Verlag.]]","DOI":"10.1007\/3-540-45744-5_42"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03177743"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/547871"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1003"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"H.\n      Zantema\n    .\n  Termination of context-sensitive rewriting\n  . In H. Comon editor 8th International Conference on Rewriting Techniques and Applications volume \n  1232\n   of \n  LNCS pages \n  172\n  --\n  186 Sitges Spain June \n  1997\n  . \n  Springer-Verlag\n  .]]   H. Zantema. Termination of context-sensitive rewriting. In H. Comon editor 8th International Conference on Rewriting Techniques and Applications volume 1232 of LNCS pages 172--186 Sitges Spain June 1997. Springer-Verlag.]]","DOI":"10.1007\/3-540-62950-5_69"}],"event":{"name":"PEPM04: Partial Evaluation and Program Manipulation 2004","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Verona Italy","acronym":"PEPM04"},"container-title":["Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014007.1014022","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014007.1014022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:29Z","timestamp":1750264289000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014007.1014022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,24]]},"references-count":31,"alternative-id":["10.1145\/1014007.1014022","10.1145\/1014007"],"URL":"https:\/\/doi.org\/10.1145\/1014007.1014022","relation":{},"subject":[],"published":{"date-parts":[[2004,8,24]]},"assertion":[{"value":"2004-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}