{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:09:31Z","timestamp":1765886971686,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402541"},{"type":"electronic","value":"9783540448815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44881-0_7","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T16:39:56Z","timestamp":1173112796000},"page":"76-87","source":"Crossref","is-referenced-by-count":100,"title":["The Maude 2.0 System"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Clavel","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Dur\u00e1n","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Eker","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Lincoln","sequence":"additional","affiliation":[]},{"given":"Narciso","family":"Mart\u00ed-Oliet","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[]},{"given":"Carolyn","family":"Talcott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0304-3975(01)00358-9","volume":"285","author":"P. Borovansk\u00fd","year":"2002","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, and P.-E. Moreau. ELAN from a rewriting logic point of view. Theoretical Computer Science, 285:155\u2013185, 2002.","journal-title":"Theoretical Computer Science"},{"key":"7_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/b94014","volume-title":"Generalized rewrite theories","author":"R. Bruni","year":"2003","unstructured":"R. Bruni and J. Meseguer. Generalized rewrite theories. To appear in Procs. of ICALP\u201903. LNCS. Springer, 2003."},{"key":"7_CR3","unstructured":"M. Clavel. Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications. CSLI Publications, 2000."},{"key":"7_CR4","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and J. Quesada. Maude Manual, 1999. http:\/\/maude.cs.uiuc.edu ."},{"key":"7_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-48685-2_18","volume-title":"Procs. of RTA\u201999","author":"M. Clavel","year":"1999","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and J. Quesada. The Maude system. In Procs. of RTA\u201999. LNCS 1631, pp. 240\u2013243. Springer, 1999."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M. Clavel","year":"2002","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and J. Quesada. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187\u2013243, 2002.","journal-title":"Theoretical Computer Science"},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1007\/3-540-48118-4_39","volume-title":"Procs. of FM\u201999","author":"M. Clavel","year":"1999","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, J. Meseguer, and M.-O. Stehr. Maude as a formal meta-tool. In Procs. of FM\u201999. LNCS 1709, pp. 1684\u20131703. Springer, 1999."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0304-3975(01)00360-7","volume":"285","author":"M. Clavel","year":"2002","unstructured":"M. Clavel and J. Meseguer. Reflection in conditional rewriting logic. Theoretical Computer Science, 285:245\u2013288, 2002.","journal-title":"Theoretical Computer Science"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J. R. Driscoll","year":"1989","unstructured":"J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent. Journal of Computer and System Science, 38:86\u2013124, 1989.","journal-title":"Journal of Computer and System Science"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"S. Eker. Term rewriting with operator evaluation strategy. In Procs. of WRLA\u201998. ENTCS 15. Elsevier, 1998.","DOI":"10.1016\/S1571-0661(05)80019-2"},{"key":"7_CR11","unstructured":"S. Eker. Associative-commutative rewriting on large terms. This volume."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"S. Eker, M. Knapp, K. Laderoute, P. Lincoln, J. Meseguer, and K. Sonmez. Pathway logic: Symbolic analysis of biological signaling. In Procs. of the Pacific Symposium on Biocomputing, pp. 400\u2013412, 2002.","DOI":"10.1142\/9789812799623_0038"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"S. Eker, M. Knapp, K. Laderoute, P. Lincoln, and C. Talcott. Pathway logic: Executable models of biological networks. In Procs. of WRLA\u201902. ENTCS 71. Elsevier, 2002.","DOI":"10.1016\/S1571-0661(05)82533-2"},{"key":"7_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-44618-4_13","volume-title":"Procs. of CONCUR\u201900","author":"K. Etessami","year":"2000","unstructured":"K. Etessami and G. J. Holzmann. Optimizing B\u00fcchi automata. In Procs. of CONCUR\u201900. LNCS 1877, pp. 153\u2013167. Springer, 2000."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"K. Futatsugi and R. Diaconescu. CafeOBJ Report. World Scientific, AMAST Series, 1998.","DOI":"10.1142\/3831"},{"key":"7_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Procs. of CAV\u201901","author":"P. Gastin","year":"2001","unstructured":"P. Gastin and D. Oddoux. Fast LTL to B\u00fcchi automata translation. In Procs. of CAV\u201901. LNCS 2102, pp. 53\u201365. Springer, 2001."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"R. Gerth, D. Peled, M. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pp. 3\u201318. Chapman and Hall, 1995.","DOI":"10.1007\/978-0-387-34892-6_1"},{"issue":"3","key":"7_CR18","first-page":"289","volume":"13","author":"G.J. Holzmann","year":"1998","unstructured":"G.J. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. Design: An International Journal, 13(3):289\u2013307, 1998.","journal-title":"Design: An International Journal"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of rewriting with strategy annotations. In Procs. of LPAR\u201901. LNAI 2250, pp. 669\u2013684. Springer, 2001.","DOI":"10.1007\/3-540-45653-8_46"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(01)00357-7","volume":"285","author":"N. Mart\u00ed-Oliet","year":"2002","unstructured":"N. Mart\u00ed-Oliet and J. Meseguer. Rewriting logic: roadmap and bibliography. Theoretical Computer Science, 285:121\u2013154, 2002.","journal-title":"Theoretical Computer Science"},{"key":"7_CR21","series-title":"Lect Notes Comput Sci","volume-title":"Equational abstractions","author":"J. Meseguer","year":"2003","unstructured":"J. Meseguer, M. Palomino, and N. Mart\u00ed-Oliet. Equational abstractions. To appear in Procs. of CADE\u201903. LNCS. Springer, 2003."},{"key":"7_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Procs. of WADT\u201997","author":"J. Meseguer","year":"1998","unstructured":"J. Meseguer. Membership algebra as a logical framework for equational specification. In Procs. of WADT\u201997. LNCS 1376, pp. 18\u201361. Springer, 1998."},{"key":"7_CR23","series-title":"Lect Notes Comput Sci","first-page":"247","volume-title":"Procs. of CAV\u201900","author":"F. Somenzi","year":"2000","unstructured":"F. Somenzi and R. Bloem. Efficient B\u00fcchi automata from LTL formulae. In Procs. of CAV\u201900. LNCS 1633, pp. 247\u2013263. Springer, 2000."},{"key":"7_CR24","unstructured":"C. Talcott. To be presented at the DARPA FTN Winter 2003 PI meeting, TX, USA, 2003."},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"P. Thati, K. Sen, and N. Mart\u00ed-Oliet. An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0. In Procs. of WRLA\u201902. ENTCS 71. Elsevier, 2002.","DOI":"10.1016\/S1571-0661(05)82539-3"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"A. Verdejo and N. Mart\u00ed-Oliet. Implementing CCS in Maude 2. In Procs. of WRLA\u201902. ENTCS 71. Elsevier, 2002.","DOI":"10.1016\/S1571-0661(05)82540-X"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0304-3975(01)00366-8","volume":"285","author":"P. Viry","year":"2002","unstructured":"P. Viry. Equational rules for rewriting logic. Theoretical Computer Science, 285:487\u2013517, 2002.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44881-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T16:08:33Z","timestamp":1736870913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44881-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402541","9783540448815"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-44881-0_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}