{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T19:23:51Z","timestamp":1761938631640,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80137-9","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"294-315","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["Towards Maude 2.0"],"prefix":"10.1016","volume":"36","author":[{"given":"M.","family":"Clave","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Dur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Eker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Lincoln","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Mart\u00ed-Oliet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.F.","family":"Quesada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80137-9_BIB1","article-title":"Ropes: An alternative to strings","volume":"25(12):1315","author":"Boehm","year":"1995","journal-title":"Software Practice and Experience"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0304-3975(99)00206-6","article-title":"Specification and proof in membership equational logic","volume":"236","author":"Bouhoula","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB3","doi-asserted-by":"crossref","unstructured":"M. Clavel. Reflection in general logics and in rewriting logic, with applications to the Maude language. Ph.D. Thesis, University of Navarre, 1998.","DOI":"10.1016\/S1571-0661(05)82553-8"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB4","series-title":"Proc. Second Int. Workshop on Rewriting Logic and its Applications, Pont\u00e0-Mousson, France","article-title":"Metalevel computation in Maude","author":"Clavel","year":"1998"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB5","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and J. F. Quesada. Maude: Specification and programming in rewriting logic. SRI International, January 1999. http:\/\/maude.csl.sri.com"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB6","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and J. F. Quesada. A tutorial on Maude. SRI International, March 2000. http:\/\/maude.csl.sri.com"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB7","unstructured":"M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proc. First Int. Workshop on Rewriting Logic and its Applications, Asilomar, California, ENTCS 4. Elsevier, 1996. http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB8","first-page":"251","article-title":"Formal specification and analysis of active networks and communication protocols: The Maude experience","volume":"Vol. 1","author":"Denker","year":"2000"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB9","series-title":"In Proc. Second Int. Symp. on Agent Systems and Applications\/Fourth Int. Symp. on Mobile Agents, Zurich, Switzerland, LNCS","article-title":"Principles of Mobile Maude","author":"Dur\u00e1n, S. Eker","year":"2000"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB10","series-title":"Proc. Third Int. Workshop on Rewriting Logic and its Applications, Kanazawa, Japan","article-title":"On parameterized theories and views for Maude","author":"Dur\u00e1n","year":"2000"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB11","first-page":"53","article-title":"Concurrent term rewriting as a model of computation","volume":"279","author":"Goguen","year":"1987"},{"year":"1997","series-title":"Java Network Programming","author":"Rusty Harold","key":"10.1016\/S1571-0661(05)80137-9_BIB12"},{"year":"1988","series-title":"The C Programming Language, Second Edition","author":"Kernighan","key":"10.1016\/S1571-0661(05)80137-9_BIB13"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB14","first-page":"123","article-title":"Implementing Parallel Rewriting. Parallelization in Inference Systems","volume":"590","author":"Kirchner","year":"1992"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB15","series-title":"Specification of Parallel Algorithms","first-page":"309","article-title":"Specification, transformation, and programming of concurrent systems in rewriting logic","author":"Lincoln","year":"1994"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB16","series-title":"Proc. First Int. Workshop on Rewriting Logic and its Applications, Asilomar, California","article-title":"Rewriting logic as a logical and semantic framework","author":"Mart\u00ed-Oliet","year":"1996"},{"issue":"1","key":"10.1016\/S1571-0661(05)80137-9_BIB17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional rewriting logic as a unified model of concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB18","series-title":"Research Directions in Object-Based Concurrency","first-page":"314","article-title":"A logical theory of concurrent objects and its realization in the Maude language","author":"Meseguer","year":"1993"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB19","series-title":"Proc. FMOODS 2000","article-title":"Rewriting logic and Maude: A wide-spectrum semantic framework for object-based distributed systems","author":"Meseguer","year":"2000"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(05)80137-9_BIB20"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB21","first-page":"179","article-title":"Level-confluence of conditional rewrite systems with extra variables in right-hand sides. Proc. 6th Int. Conf. on Rewriting Techniques and Applications, Kaiserslautern","volume":"914","author":"Suzuki","year":"1995","journal-title":"LNCS"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB22","series-title":"de Sistemas Inform\u00e1ticos y Programaci\u00f3n","article-title":"Executing and verifying CCS in Maude. Technical Report 99-00, Depto","author":"Verdejo","year":"2000"},{"key":"10.1016\/S1571-0661(05)80137-9_BIB23","first-page":"648","article-title":"Rewriting: An effective model of concurrency","volume":"817","author":"Viry","year":"1994"},{"year":"1996","series-title":"Internet Programming with Python","author":"Watters","key":"10.1016\/S1571-0661(05)80137-9_BIB24"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:49Z","timestamp":1761610129000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":24,"alternative-id":["S1571066105801379"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80137-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards Maude 2.0","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80137-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}