{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T23:04:44Z","timestamp":1777590284800,"version":"3.51.4"},"reference-count":68,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4039,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0304-3975(01)00359-0","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T15:06:23Z","timestamp":1032275183000},"page":"187-243","source":"Crossref","is-referenced-by-count":379,"title":["Maude: specification and programming in rewriting logic"],"prefix":"10.1016","volume":"285","author":[{"given":"M.","family":"Clavel","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\u0131\u0301-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\/S0304-3975(01)00359-0_BIB1","series-title":"Algebraic Foundations of Systems Specification, IFIP State-of-the-Art Reports","author":"Astesiano","year":"1999"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB2","first-page":"55","article-title":"Rewriting logic as a metalogical framework","volume":"Vol. 1974","author":"Basin","year":"2000"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB3","first-page":"76","article-title":"Characterization of computable data types by means of a finite equational specification method","volume":"Vol. 81","author":"Bergstra","year":"1980"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB4","unstructured":"P. Borovansk\u00fd, Le Contr\u00f4le de la R\u00e9\u00e9criture: \u00c9tude et Implantation d'un Formalisme de Strat\u00e9gies. Ph.D. Thesis, Universit\u00e9 Henri Poincar\u00e9 \u2013 Nancy I, October 1998."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB5","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, Controlling rewriting by rewriting, in: J. Meseguer (Ed.), Proc. 1st Int. Workshop on Rewriting Logic and its Applications, WRLA\u201996, Asilomar, California, September 3\u20136, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, Sept. 1996, pp. 168\u2013188, http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB6","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, Rewriting as a unified specification tool for logic and control: the ELAN language, in: M.P.A. Sellink (Ed.), 2nd Int. Workshop on the Theory and Practice of Algebraic Specifications, Amsterdam, The Netherlands, September 25\u201326, 1997, Electronic Workshops in Computing. Springer, Berlin, 1998, http:\/\/www.ewic.org.uk\/ewic\/workshop\/view.cfm\/ASFSDF-97.","DOI":"10.14236\/ewic\/AL1997.3"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB7","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen, An overview of ELAN, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Int. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Pont-\u00e0-Mousson, France, September 1\u20134, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 329\u2013344, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB8","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, M. Vittek, ELAN: a logical framework based on computational systems, in: J. Meseguer (Ed.), Proc. 1st Int. Workshop on Rewriting Logic and its Applications, WRLA\u201996, Asilomar, California, September 3\u20136, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, Sept. 1996, pp. 35\u201350, http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html.","DOI":"10.1016\/S1571-0661(04)00032-5"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB9","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB10","first-page":"292","article-title":"The semantics of Clear, a specification language","volume":"Vol. 86","author":"Burstall","year":"1980"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB11","unstructured":"G. Carabetta, P. Degano, F. Gadducci, CCS semantics via proved transition systems and rewriting logic, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Int. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Pont-\u00e0-Mousson, France, September 1\u20134, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 253\u2013272, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB12","series-title":"Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications","author":"Clavel","year":"2002"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB13","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u0131\u0301-Oliet, J. Meseguer, Metalevel computation in Maude, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Int. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Pont-\u00e0-Mousson, France, September 1\u20134, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 3\u201324, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB14","doi-asserted-by":"crossref","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u0131\u0301-Oliet, J. Meseguer, J.F. Quesada, Maude: specification and programming in rewriting logic, Manual distributed as documentation of the Maude system, Computer Science Laboratory, SRI International, http:\/\/maude.csl.sri.com\/manual, January 1999.","DOI":"10.1007\/3-540-48685-2_18"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB15","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u0131\u0301-Oliet, J. Meseguer, J.F. Quesada, A Maude tutorial, Tutorial distributed as documentation of the Maude system, Computer Science Laboratory, SRI International. Presented at the European Joint Conference on Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25, 2000, http:\/\/maude.csl.sri.com\/tutorial, March 2000."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB16","doi-asserted-by":"crossref","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u0131\u0301-Oliet, J. Meseguer, J.F. Quesada, Towards Maude 2.0, in: K. Futatsugi (Ed.), Proc. 3rd Int. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18\u201320, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 297\u2013318, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html.","DOI":"10.1016\/S1571-0661(05)80137-9"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB17","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, J. Meseguer, Building equational proving tools by reflection in rewriting logic, in: Proc. CafeOBJ Symp. \u201998, Numazu, Japan, CafeOBJ Project, April 1998, http:\/\/maude.csl.sri.com\/papers."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB18","first-page":"1684","article-title":"Maude as a formal meta-tool","volume":"Vol. 1709","author":"Clavel","year":"1999"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB19","doi-asserted-by":"crossref","unstructured":"M. Clavel, S. Eker, P. Lincoln, J. Meseguer, Principles of Maude, in: J. Meseguer (Ed.), Proc. 1st Int. Workshop on Rewriting Logic and its Applications, WRLA\u201996, Asilomar, California, September 3\u20136, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, Sept. 1996, pp. 65\u201389, http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html.","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB20","doi-asserted-by":"crossref","unstructured":"M. Clavel, J. Meseguer, Reflection in conditional rewriting logic, Theoret. Comput. Sci. 2002, this volume.","DOI":"10.1016\/S0304-3975(01)00360-7"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB21","doi-asserted-by":"crossref","unstructured":"G. Denker, J. Meseguer, C.L. Talcott, Formal specification and analysis of active networks and communication protocols: the Maude experience, in: D. Maughan, G. Koob, S. Saydjari (Eds.), Proc. DARPA Information Survivability Conference and Exposition, DISCEX 2000, Hilton Head Island, South Carolina, January 25\u201327, 2000, IEEE Computer Society Press, Silver Spring, MD, 2000, pp. 251\u2013265, http:\/\/schafercorp-ballston.com\/discex\/.","DOI":"10.1109\/DISCEX.2000.825030"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB22","series-title":"Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, Chap. 6","first-page":"243","article-title":"Rewrite systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB23","series-title":"CafeOBJ Report, The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification, AMAST Series in Computing. Vol. 6","author":"Diaconescu","year":"1998"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB24","first-page":"1644","article-title":"Component-based algebraic specification and verification in CafeOBJ","volume":"Vol. 1709","author":"Diaconescu","year":"1999"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB25","unstructured":"R. Diaconescu, K. Futatsugi, M. Ishisone, T. Sawada, A.T. Nakagawa, An overview of CafeOBJ, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Int. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Pont-\u00e0-Mousson, France, September 1\u20134, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 75\u201388, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB26","unstructured":"R. Diaconescu, J. Goguen, P. Stefaneas, Logical support for modularization, in: G. Huet, G. Plotkin, C. Jones (Eds.), Proc. Workshop on Logical Frameworks, Edinburgh, UK, May 1991, Cambridge University Press, Cambridge, May 1991, pp. 83\u2013130."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB27","unstructured":"F. Dur\u00e1n, A Reflective Module Algebra with Applications to the Maude Language, Ph.D. Thesis, Universidad de M\u00e1laga, Spain, June 1999, http:\/\/maude.csl.sri.com\/papers."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB28","first-page":"422","article-title":"The extensibility of Maude's module algebra","volume":"Vol. 1816","author":"Dur\u00e1n","year":"2000"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB29","first-page":"73","article-title":"Principles of mobile Maude","volume":"Vol. 1882","author":"Dur\u00e1n","year":"2000"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB30","unstructured":"F. Dur\u00e1n, J. Meseguer, An extensible module algebra for Maude, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Int. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Pont-\u00e0-Mousson, France, September 1\u20134, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 185\u2013206, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB31","doi-asserted-by":"crossref","unstructured":"F. Dur\u00e1n, J. Meseguer, Parameterized theories and views in Full Maude 2.0, in: K. Futatsugi (Ed.), Proc. 3rd Int. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18\u201320, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 319\u2013337, http:\/\/www.elsevier.nl\/locate\/entcs\/volume36.html.","DOI":"10.1016\/S1571-0661(05)80136-7"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB32","doi-asserted-by":"crossref","unstructured":"S. Eker, Fast matching in combination of regular equational theories, in: J. Meseguer (Ed.), Proc. 1st Int. Workshop on Rewriting Logic and its Applications, WRLA\u201996, Asilomar, California, September 3\u20136, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, Sept. 1996, pp. 90\u2013108. http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html.","DOI":"10.1016\/S1571-0661(04)00035-0"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB33","unstructured":"S. Eker, Term rewriting with operator evaluation strategy, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Int. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Pont-\u00e0-Mousson, France, September 1\u20134, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, pp. 45\u201362. http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB34","unstructured":"K. Futatsugi (Ed.), Proc. 3rd Int. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18\u201320, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, http:\/\/www.elsevier.nl\/locate\/entcs\/volume36.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB35","doi-asserted-by":"crossref","unstructured":"F. Gadducci, U. Montanari, Comparing logics for rewriting: rewriting logic, action calculi and tile logic, Theoret. Comput. Sci., 2002, this volume.","DOI":"10.1016\/S0304-3975(01)00362-0"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB36","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","article-title":"Order-sorted algebra I","volume":"105","author":"Goguen","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB37","series-title":"Software Engineering with OBJ: Algebraic Sspecification in Action, Advances in Formal Methods, Chap. 1","first-page":"3","article-title":"Introducing OBJ","author":"Goguen","year":"2000"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB38","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0215084","article-title":"Completion of a set of rules modulo a set of equations","volume":"15","author":"Jouannaud","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB39","unstructured":"C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Int. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Pont-\u00e0-Mousson, France, September 1\u20134, 1998, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1998, http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB40","series-title":"Principles and Practice of Constraint Programming: The Newport Papers","first-page":"133","article-title":"Designing constraint logic programming languages using computational systems","author":"Kirchner","year":"1995"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB41","doi-asserted-by":"crossref","unstructured":"N. Mart\u0131\u0301-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, in: D.Gabbay (Ed.), Handbook of Philosophical Logic, Second Edition, Vol. 9, Kluwer Academic Publishers, Dordrecht, 2002, http:\/\/maude.csl.sri.com\/papers.","DOI":"10.1007\/978-94-017-0464-9_1"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB42","unstructured":"J. Meseguer, Rewriting as a unified model of concurrency, Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990, Revised June 1990."},{"issue":"1","key":"10.1016\/S0304-3975(01)00359-0_BIB43","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB44","series-title":"Research Directions in Concurrent Object-Oriented Programming","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\/S0304-3975(01)00359-0_BIB45","first-page":"220","article-title":"Solving the inheritance anomaly in concurrent object-oriented programming","volume":"Vol. 707","author":"Meseguer","year":"1993"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB46","unstructured":"J. Meseguer (Ed.), Proc. 1st Int. Workshop on Rewriting Logic and its Applications, WRLA\u201996, Asilomar, California, September 3\u20136, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, Sept. 1996, http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB47","first-page":"331","article-title":"Rewriting logic as a semantic framework for concurrency","volume":"Vol. 1119","author":"Meseguer","year":"1996"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB48","first-page":"18","article-title":"Membership algebra as a logical framework for equational specification","volume":"Vol. 1376","author":"Meseguer","year":"1998"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB49","first-page":"347","article-title":"Research directions in rewriting logic","volume":"Vol. 165","author":"Meseguer","year":"1998"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB50","series-title":"Proc. IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems IV, FMOODS 2000, September 6\u20138, 2000, Stanford, CA, USA","first-page":"89","article-title":"Rewriting logic and Maude: a wide-spectrum semantic framework for object-based distributed systems","author":"Meseguer","year":"2000"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB51","first-page":"1","article-title":"Rewriting logic and Maude: concepts and applications","volume":"Vol. 1833","author":"Meseguer","year":"2000"},{"issue":"1","key":"10.1016\/S0304-3975(01)00359-0_BIB52","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1006\/inco.1993.1016","article-title":"Order-sorted algebra solves the constructor-selector, multiple representation and coercion problems","volume":"104","author":"Meseguer","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB53","first-page":"415","article-title":"A partial order event model for concurrent objects","volume":"Vol. 1664","author":"Meseguer","year":"1999"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB54","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB55","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/S0747-7171(08)80145-9","article-title":"Combining matching algorithms: the regular case","volume":"12","author":"Nipkow","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB56","unstructured":"P.C. \u00d6lveczky, Specification and Analysis of Real-Time and Hybrid Systems in Rewriting Logic, Ph.D. Thesis, University of Bergen, Norway, 2000, http:\/\/maude.csl.sri.com\/papers."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB57","doi-asserted-by":"crossref","unstructured":"P.C. \u00d6lveczky, J. Meseguer, Real-time Maude: a tool for simulating and analyzing real-time and hybrid systems, in: K. Futatsugi (Ed.), Proc. 3rd Int. Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18\u201320, 2000, Electronic Notes in Theoretical Computer Science, Vol. 36, Elsevier, Amsterdam, 2000, pp. 361\u2013383, http:\/\/www.elsevier.nl\/locate\/entcs\/volume36.html.","DOI":"10.1016\/S1571-0661(05)80134-3"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB58","doi-asserted-by":"crossref","unstructured":"P.C. \u00d6lveczky, J. Meseguer, Specification of real-time and hybrid systems in rewriting logic, Theoret. Comput. Sci., 2002, this volume.","DOI":"10.1016\/S0304-3975(01)00363-2"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB59","unstructured":"J.F. Quesada, The SCP parsing algorithm based on syntactic constraints propagation, Ph.D. Thesis, Universidad de Sevilla, Spain, June 1997."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB60","unstructured":"J.F. Quesada, The Maude parser: parsing and meta-parsing \u03b2-extended context-free grammars, Tech. Rep. Computer Science Laboratory, SRI International, 2001, in preparation."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB61","first-page":"179","article-title":"Level-confluence of conditional rewrite systems with extra variables in right-hand sides","volume":"Vol. 914","author":"Suzuki","year":"1995"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB62","unstructured":"C.L. Talcott, An actor rewriting theory, in: J. Meseguer (Ed.), Proc. 1st Int. Workshop on Rewriting Logic and its Applications, WRLA\u201996, Asilomar, California, September 3\u20136, 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, Sept. 1996, pp. 360\u2013383, http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB63","series-title":"Proc. IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems, FMOODS\u201996","first-page":"154","article-title":"Interaction semantics for components of distributed systems","author":"Talcott","year":"1997"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB64","first-page":"391","article-title":"Towards a toolkit for actor system specification","volume":"Vol. 1816","author":"Talcott","year":"2000"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB65","doi-asserted-by":"crossref","unstructured":"C.L. Talcott, Actor theories in rewriting logic, Theoret. Comput. Sci., 2002, this volume.","DOI":"10.1016\/S0304-3975(01)00365-6"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB66","unstructured":"A. Verdejo, N. Mart\u0131\u0301-Oliet, Executing and verifying CCS in Maude, Tech. Rep. 99-00, Departamento de Sistemas Inform\u00e1ticos y Programaci\u00f3n, Universidad Complutense de Madrid, Feb. 2000, http:\/\/maude.csl.sri.com\/casestudies\/ccs."},{"key":"10.1016\/S0304-3975(01)00359-0_BIB67","first-page":"648","article-title":"Rewriting: an effective model of concurrency","volume":"Vol. 817","author":"Viry","year":"1994"},{"key":"10.1016\/S0304-3975(01)00359-0_BIB68","unstructured":"P. Viry, Rewriting modulo a rewrite system, Technical Report TR-95-20, Dipartimento di Informatica, Universit\u00e0 di Pisa, December 1995, ftp:\/\/ftp.di.unipi.it\/pub\/techreports\/TR-95-20.ps.Z."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003590?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003590?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T12:59:06Z","timestamp":1733230746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0304397501003590"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00359-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}