{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T23:02:42Z","timestamp":1776553362005,"version":"3.51.2"},"publisher-location":"Cham","reference-count":83,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319231648","type":"print"},{"value":"9783319231655","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23165-5_11","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T03:57:43Z","timestamp":1440561463000},"page":"232-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Two Decades of Maude"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Clavel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Dur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Eker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago","family":"Escobar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Lincoln","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narciso","family":"Mart\u00ed-Oliet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolyn","family":"Talcott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. J. ACM 47(4), 776\u2013822 (2000)","journal-title":"J. ACM"},{"key":"11_CR2","unstructured":"Bae, K., Escobar, S., Meseguer, J.: Abstract logical model checking of infinite-state systems using narrowing. In: van Raamsdonk, F. (ed.) 24th International Conference on Rewriting Techniques and Applications, RTA 2013, Eindhoven, The Netherlands, 24\u201326 June 2013. LIPIcs, vol. 21, pp. 81\u201396. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.scico.2014.09.011","volume":"103","author":"K Bae","year":"2015","unstructured":"Bae, K., Krisiloff, J., Meseguer, J., \u00d6lveczky, P.C.: Designing and verifying distributed cyber-physical systems using multirate PALS: an airplane turning control system case study. Sci. Comput. Program. 103, 13\u201350 (2015)","journal-title":"Sci. Comput. Program."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.scico.2014.02.006","volume":"99","author":"K Bae","year":"2015","unstructured":"Bae, K., Meseguer, J.: Model checking linear temporal logic of rewriting formulas under localized fairness. Sci. Comput. Program. 99, 193\u2013234 (2015)","journal-title":"Sci. Comput. Program."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-22110-1_14","volume-title":"Computer Aided Verification","author":"C Barrett","year":"2011","unstructured":"Barrett, C., Conway, C.L., Deters, M., Hadarean, L., Jovanovi\u0107, D., King, T., Reynolds, A., Tinelli, C.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 171\u2013177. Springer, Heidelberg (2011)"},{"key":"11_CR6","unstructured":"Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard: Version 2.0. Technical report, Department of Computer Science, The University of Iowa (2010). http:\/\/smt-lib.org"},{"key":"11_CR7","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 825\u2013885. IOS Press (2009)"},{"issue":"3\u20134","key":"11_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00165-009-0140-9","volume":"22","author":"A Boronat","year":"2010","unstructured":"Boronat, A., Meseguer, J.: An algebraic semantics for MOF. Formal Asp. Comput. 22(3\u20134), 269\u2013296 (2010)","journal-title":"Formal Asp. Comput."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(99)00206-6","volume":"236","author":"A Bouhoula","year":"2000","unstructured":"Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic. Theor. Comput. Sci. 236(1), 35\u2013132 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-48285-7_30","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"S Brands","year":"1994","unstructured":"Brands, S., Chaum, D.: Distance bounding protocols. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 344\u2013359. Springer, Heidelberg (1994)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(96)00160-0","volume":"173","author":"M Cerioli","year":"1997","unstructured":"Cerioli, M., Meseguer, J.: May i borrow your logic? (Transporting logical structure along maps). Theor. Comput. Sci. 173, 311\u2013347 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Clavel, M.: Reflection in General Logics and in Rewriting Logic, with Applications to the Maude Language. Ph.D. thesis, Universidad de Navarra, Spain, February 1998","DOI":"10.1016\/S1571-0661(05)82553-8"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Clavel, M.: Reflection in general logics, rewriting logic, and Maude. In: Kirchner, Kirchner (eds.) [53], pp. 71\u201382","DOI":"10.1016\/S1571-0661(05)82553-8"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-02348-4_27","volume-title":"Rewriting Techniques and Applications","author":"M Clavel","year":"2009","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Escobar, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: Unification and narrowing in Maude 2.4. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 380\u2013390. Springer, Heidelberg (2009)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J.: Metalevel computation in Maude. In: Kirchner and Kirchner [53], pp. 331\u2013352","DOI":"10.1016\/S1571-0661(05)80020-9"},{"key":"11_CR16","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. SRI International, January 1999. http:\/\/maude.cs.uiuc.edu\/maude1\/manual\/"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Maude as a metalanguage. In: Kirchner and Kirchner [53], pp. 147\u2013160","DOI":"10.1016\/S1571-0661(05)82557-5"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-48685-2_18","volume-title":"Rewriting Techniques and Applications","author":"M Clavel","year":"1999","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: The Maude system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 240\u2013243. Springer, Heidelberg (1999)"},{"key":"11_CR19","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: 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, 25 March 2000"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Towards Maude 2.0. In: Futatsugi [45], pp. 294\u2013315","DOI":"10.1016\/S1571-0661(05)80137-9"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-46428-X_27","volume-title":"Fundamental Approaches to Software Engineering","author":"M Clavel","year":"2000","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Using Maude. In: Maibaum, T. (ed.) FASE 2000. LNCS, vol. 1783, pp. 371\u2013374. Springer, Heidelberg (2000)"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M Clavel","year":"2002","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2), 187\u2013243 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-44881-0_7","volume-title":"Rewriting Techniques and Applications","author":"M Clavel","year":"2003","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L.: The Maude 2.0 system. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 76\u201387. Springer, Heidelberg (2003)"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Clavel, M., Eker, S., Lincoln, P., Meseguer, J.: Principles of Maude. In: Meseguer [67], pp. 65\u201389","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"11_CR26","unstructured":"Clavel, M., Meseguer, J.: Reflection and strategies in rewriting logic. In: Meseguer [67], pp. 126\u2013148"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-32033-3_22","volume-title":"Term Rewriting and Applications","author":"H Comon-Lundh","year":"2005","unstructured":"Comon-Lundh, H., Delaune, S.: The finite variant property: how to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 294\u2013307. Springer, Heidelberg (2005)"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-45499-3_29","volume-title":"Algebraic Methodology and Software Technology","author":"CO Braga","year":"2000","unstructured":"Braga, C.O., Haeusler, E.H., Meseguer, J., Mosses, P.D.: Maude action tool: using reflection to map action semantics to rewriting logic. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 407\u2013421. Springer, Heidelberg (2000)"},{"key":"11_CR29","unstructured":"Dur\u00e1n, F.: A Reflective Module Algebra with Applications to the Maude Language. Ph.D. thesis, Universidad de M\u00e1laga, Spain, June 1999"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-45499-3_30","volume-title":"Algebraic Methodology and Software Technology","author":"F Dur\u00e1n","year":"2000","unstructured":"Dur\u00e1n, F.: The extensibility of Maude\u2019s module algebra. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 422\u2013437. Springer, Heidelberg (2000)"},{"key":"11_CR31","unstructured":"Dur\u00e1n, F., Eker, S., Escobar, S., Meseguer, J., Talcott, C.L.: Variants, unification, narrowing, and symbolic reachability in Maude 2.6. In: Schmidt-Schau\u00df, M. (ed.) Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, Novi Sad, Serbia, 30 May - 1 June, 2011. LIPIcs, vol. 10, pp. 31\u201340. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-45347-5_7","volume-title":"Agent Systems, Mobile Agents, and Applications","author":"F Dur\u00e1n","year":"2000","unstructured":"Dur\u00e1n, F., Eker, S., Lincoln, P., Meseguer, J.: Principles of mobile Maude. In: Kotz, D., Mattern, F. (eds.) MA 2000, ASA\/MA 2000, and ASA 2000. LNCS, vol. 1882, pp. 73\u201385. Springer, Heidelberg (2000)"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-71070-7_27","volume-title":"Automated Reasoning","author":"F Dur\u00e1n","year":"2008","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J.: MTT: the Maude termination tool (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 313\u2013319. Springer, Heidelberg (2008)"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n, F., Meseguer, J.: An extensible module algebra for Maude. In: Kirchner and Kirchner [53], pp. 174\u2013195","DOI":"10.1016\/S1571-0661(05)80012-X"},{"issue":"2","key":"11_CR35","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.scico.2006.07.002","volume":"66","author":"F Dur\u00e1n","year":"2007","unstructured":"Dur\u00e1n, F., Meseguer, J.: Maude\u2019s module algebra. Sci. Comput. Program. 66(2), 125\u2013153 (2007)","journal-title":"Sci. Comput. Program."},{"issue":"7\u20138","key":"11_CR36","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.jlap.2011.12.004","volume":"81","author":"F Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Meseguer, J.: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. J. Logic Algebraic Program. 81(7\u20138), 816\u2013850 (2012)","journal-title":"J. Logic Algebraic Program."},{"issue":"4","key":"11_CR37","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.entcs.2007.06.011","volume":"176","author":"F Dur\u00e1n","year":"2007","unstructured":"Dur\u00e1n, F., Riesco, A., Verdejo, A.: A distributed implementation of mobile Maude. Electr. Notes Theor. Comput. Sci. 176(4), 113\u2013131 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-24933-4_17","volume-title":"Formal Modeling: Actors, Open Systems, Biological Systems","author":"F Dur\u00e1n","year":"2011","unstructured":"Dur\u00e1n, F., Rocha, C., \u00c1lvarez, J.M.: Towards a Maude formal environment. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Formal Modeling: Actors, Open Systems, Biological Systems. LNCS, vol. 7000, pp. 329\u2013351. Springer, Heidelberg (2011)"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Eker, S., Knapp, M., Laderoute, K., Lincoln, P., Meseguer, J., Sonmez, K.: Pathway logic: symbolic analysis of biological signaling. In: Proceedings of the Pacific Symposium on Biocomputing, pp. 400\u2013412, January 2002","DOI":"10.1142\/9789812799623_0038"},{"key":"11_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-54624-2_16","volume-title":"Specification, Algebra, and Software","author":"S Escobar","year":"2014","unstructured":"Escobar, S.: Functional logic programming in Maude. In: Iida, S., Meseguer, J., Ogata, K. (eds.) Specification, Algebra, and Software. LNCS, vol. 8373, pp. 315\u2013336. Springer, Heidelberg (2014)"},{"key":"11_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03829-7_1","volume-title":"Foundations of Security Analysis and Design V","author":"S Escobar","year":"2007","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: cryptographic protocol analysis modulo equational properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007\/2008\/2009. LNCS, vol. 5705, pp. 1\u201350. Springer, Heidelberg (2007)"},{"key":"11_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-73449-9_13","volume-title":"Term Rewriting and Applications","author":"S Escobar","year":"2007","unstructured":"Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153\u2013168. Springer, Heidelberg (2007)"},{"issue":"7\u20138","key":"11_CR43","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.jlap.2012.01.002","volume":"81","author":"S Escobar","year":"2012","unstructured":"Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. J. Logic Algebraic Program. 81(7\u20138), 898\u2013928 (2012)","journal-title":"J. Logic Algebraic Program."},{"key":"11_CR44","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.scico.2014.06.010","volume":"99","author":"M Fadlisyah","year":"2015","unstructured":"Fadlisyah, M., \u00d6lveczky, P.C., \u00c1brah\u00e1m, E.: Formal modeling and analysis of interacting hybrid systems in HI-Maude: what happened at the 2010 sauna world championships? Sci. Comput. Program. 99, 95\u2013127 (2015)","journal-title":"Sci. Comput. Program."},{"key":"11_CR45","unstructured":"Futatsugi, K. (ed.): Proceedings of the Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, 18\u201320 September 2000. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2000)"},{"key":"11_CR46","unstructured":"Goguen, J., Meseguer, J.: Eqlog: equality, types and generic modules for logic programming. In: DeGroot, D., Lindstrom, G. (eds.) Logic Programming, Functions, Relations and Equations, pp. 295\u2013363. Prentice-Hall (1986)"},{"key":"11_CR47","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J Goguen","year":"1992","unstructured":"Goguen, J., Meseguer, J.: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theor. Comput. Sci. 105, 217\u2013273 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Introducing OBJ. In: Goguen, J.A., Malcolm, G. (eds.) Software Engineering with OBJ: Algebraic Specification in Action, pp. 3\u2013167. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-1-4757-6541-0_1"},{"issue":"2","key":"11_CR49","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","volume":"1","author":"JA Goguen","year":"1984","unstructured":"Goguen, J.A., Meseguer, J.: Equality, types, modules, and (why not?) generics for logic programming. J. Logic Program. 1(2), 179\u2013210 (1984)","journal-title":"J. Logic Program."},{"key":"11_CR50","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/11814771_14","volume-title":"Automated Reasoning","author":"J Hendrix","year":"2006","unstructured":"Hendrix, J., Meseguer, J., Ohsaki, H.: A sufficient completeness checker for linear order-sorted specifications modulo axioms. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 151\u2013155. Springer, Heidelberg (2006)"},{"key":"11_CR51","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C., Perovic, R.: A rewriting framework for activities subject to regulations. In: Tiwari, A. (ed.) 23rd International Conference on RewritingTechniques and Applications (RTA). LIPIcs, vol. 15, pp. 305\u2013322. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"11_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-3-662-46666-7_14","volume-title":"Principles of Security and Trust","author":"M Kanovich","year":"2015","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.: Discrete vs. dense times in the analysis of cyber-physical security protocols. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 259\u2013279. Springer, Heidelberg (2015)"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Kirchner, C, Kirchner, H. (eds.) Proceedings of the Second International Workshop on Rewriting Logic and its Applications, WRLA 1998, Pont-\u00e0-Mousson, France, 1\u20134 September 1998. Electronic Notes in Theoretical Computer Science, vol. 15. Elsevier, Amsterdam (1998)","DOI":"10.1016\/S1571-0661(05)80022-2"},{"key":"11_CR54","doi-asserted-by":"crossref","unstructured":"Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J.: Specification, transformation, and programming of concurrent systems in rewriting logic. In: Blelloch, G.E., Chandy, K.M., Jagannathan, S. (eds.) Specification of Parallel Algorithms, DIMACS Workshop, 9\u201311 May 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 18, pp. 309\u2013339. American Mathematical Society (1994)","DOI":"10.1090\/dimacs\/018\/20"},{"key":"11_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-58184-7_88","volume-title":"PARLE \u201994 Parallel Architectures and Languages Europe","author":"P Lincoln","year":"1994","unstructured":"Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Ricciulli, L.: Compiling rewriting onto SIMD and MIMD\/SIMD machines. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 37\u201348. Springer, Heidelberg (1994)"},{"key":"11_CR56","unstructured":"Lincoln, P.D., Talcott, C.: Symbolic systems biology and pathway logic. In: Iyengar, S. (eds.) Symbolic Systems Biology, pp. 1\u201329. Jones and Bartlett (2010)"},{"issue":"1","key":"11_CR57","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0890-5401(02)93176-7","volume":"178","author":"S Lucas","year":"2002","unstructured":"Lucas, S.: Context-sensitive rewriting strategies. Inf. Comput. 178(1), 294\u2013343 (2002)","journal-title":"Inf. Comput."},{"key":"11_CR58","doi-asserted-by":"crossref","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: Action and change in rewriting logic. In: Pareschi, R., Fronh\u00f6fer, B. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management. Applied Logic Series, vol. 12, pp. 1\u201353. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-94-017-1317-7_1"},{"key":"11_CR59","doi-asserted-by":"crossref","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: Rewriting logic as a logical and semantic framework. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 9, pp. 1\u201387. Kluwer Academic Publishers (2002)","DOI":"10.1007\/978-94-017-0464-9_1"},{"issue":"7\u20138","key":"11_CR60","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.jlap.2012.06.001","volume":"81","author":"N Mart\u00ed-Oliet","year":"2012","unstructured":"Mart\u00ed-Oliet, N., Palomino, M., Verdejo, A.: Rewriting logic bibliography by topic: 1990\u20132011. J. Logic Algebraic Program. 81(7\u20138), 782\u2013815 (2012)","journal-title":"J. Logic Algebraic Program."},{"key":"11_CR61","doi-asserted-by":"crossref","unstructured":"Mason, I.A., Talcott, C.L.: IOP: the interoperability platform & IMaude: an interactive extension of Maude. In: Mart\u00ed-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, 27\u201328 March 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 315\u2013333. Elsevier (2005). http:\/\/www.sciencedirect.com\/science\/journal\/15710661","DOI":"10.1016\/j.entcs.2004.06.016"},{"key":"11_CR62","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: A logical theory of concurrent objects. In: Meyrowitz, N. (ed.) Proceedings of the ECOOP-OOPSLA 1990 Conference on Object-Oriented Programming, Ottawa, Canada, 21\u201325 October 1990, pp. 101\u2013115. ACM Press (1990)","DOI":"10.1145\/97946.97958"},{"key":"11_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/BFb0039072","volume-title":"CONCUR 1990 Theories of Concurrency: Unification and Extension","author":"J Meseguer","year":"1990","unstructured":"Meseguer, J.: Rewriting as a unified model of concurrency. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 384\u2013400. Springer, Heidelberg (1990)"},{"issue":"1","key":"11_CR64","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73\u2013155 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/BFb0013826","volume-title":"Algebraic and Logic Programming","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Multiparadigm logic programming. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 158\u2013200. Springer, Heidelberg (1992)"},{"key":"11_CR66","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: A logical theory of concurrent objects and its realization in the Maude language. In: Agha, G., Wegner, P., Yonezawa, A. (eds.) Research Directions in Concurrent Object-Oriented Programming, pp. 314\u2013390. The MIT Press (1993)","DOI":"10.7551\/mitpress\/2087.003.0017"},{"key":"11_CR67","unstructured":"Meseguer, J. (ed.) Proceedings of the First International Workshop on Rewriting Logic and its Applications, WRLA 1996, Asilomar, California, 3\u20136 September 1996. Electronic Notes in Theoretical Computer Science, vol. 4. Elsevier, Amsterdam (1996)"},{"key":"11_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-61604-7_64","volume-title":"CONCUR 1996: Concurrency Theory","author":"J Meseguer","year":"1996","unstructured":"Meseguer, J.: Rewriting logic as a semantic framework for concurrency: a progressreport. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 331\u2013372. Springer, Heidelberg (1996)"},{"key":"11_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equationalspecification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18\u201361. Springer, Heidelberg (1998)"},{"key":"11_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11780274_14","volume-title":"Algebra, Meaning, and Computation","author":"J Meseguer","year":"2006","unstructured":"Meseguer, J.: From OBJ to Maude and beyond. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 252\u2013280. Springer, Heidelberg (2006)"},{"key":"11_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-68679-8_22","volume-title":"Concurrency, Graphs and Models","author":"J Meseguer","year":"2008","unstructured":"Meseguer, J.: The temporal logic of rewriting: a gentle introduction. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 354\u2013382. Springer, Heidelberg (2008)"},{"issue":"7\u20138","key":"11_CR72","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.jlap.2012.06.003","volume":"81","author":"J Meseguer","year":"2012","unstructured":"Meseguer, J.: Twenty years of rewriting logic. J. Logic Algebraic Program. 81(7\u20138), 721\u2013781 (2012)","journal-title":"J. Logic Algebraic Program."},{"key":"11_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-47993-7_1","volume-title":"ECOOP 2002 - Object-Oriented Programming","author":"J Meseguer","year":"2002","unstructured":"Meseguer, J., Talcott, C.: Semantic models for distributed object reflection. In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 1\u201336. Springer, Heidelberg (2002)"},{"issue":"1\u20132","key":"11_CR74","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10990-007-9000-6","volume":"20","author":"J Meseguer","year":"2007","unstructured":"Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. High.-Order Symbolic Comput. 20(1\u20132), 123\u2013160 (2007)","journal-title":"High.-Order Symbolic Comput."},{"key":"11_CR75","series-title":"Lecture Notes in Computer Science","volume-title":"Research Directions in High-Level Parallel Programming Languages","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J., Winkler, T.C.: Parallel programmming in Maude. In: Ban\u00e2tre, J.-P., Le M\u00e9tayer, D. (eds.) Research Directions in High-Level Parallel Programming Languages 1991. LNCS, vol. 574. Springer, Heidelberg (1992)"},{"issue":"1\u20132","key":"11_CR76","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10990-007-9001-5","volume":"20","author":"PC \u00d6lveczky","year":"2007","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: Semantics and pragmatics of real-time Maude. High.-Order Symbolic Comput. 20(1\u20132), 161\u2013196 (2007)","journal-title":"High.-Order Symbolic Comput."},{"issue":"11\u201312","key":"11_CR77","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1177\/0037549709341635","volume":"85","author":"JE Rivera","year":"2009","unstructured":"Rivera, J.E., Dur\u00e1n, F., Vallecillo, A.: Formal specification and analysis of domain specific models using Maude. Simulation 85(11\u201312), 778\u2013792 (2009)","journal-title":"Simulation"},{"key":"11_CR78","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-319-12904-4_14","volume-title":"Rewriting Logic and Its Applications","author":"C Rocha","year":"2014","unstructured":"Rocha, C., Meseguer, J., Mu\u00f1oz, C.: Rewriting modulo SMT and open system analysis. In: Escobar, S. (ed.) WRLA 2014. LNCS, vol. 8663, pp. 247\u2013262. Springer, Heidelberg (2014)"},{"key":"11_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-44988-4_27","volume-title":"Application and Theory of Petri Nets 2000","author":"K Schmidt","year":"2000","unstructured":"Schmidt, K.: LoLA: a low level analyser. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 465\u2013474. Springer, Heidelberg (2000)"},{"key":"11_CR80","doi-asserted-by":"crossref","unstructured":"Talcott, C.: Symbolic modeling of signal transduction in pathway logic. In: Perrone, L.F., Wieland, F.P., Liu, J., Lawson, B.G., Nicol, D.M., Fujimoto, R.M. (eds.) 2006 Winter Simulation Conference, pp. 1656\u20131665 (2006)","DOI":"10.1109\/WSC.2006.322940"},{"key":"11_CR81","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11880646_10","volume-title":"Transactions on Computational Systems Biology VI","author":"C Talcott","year":"2006","unstructured":"Talcott, C., Dill, D.L.: Multiple representations of biological processes. In: Priami, C., Plotkin, G. (eds.) Transactions on Computational Systems Biology VI. LNCS (LNBI), vol. 4220, pp. 221\u2013245. Springer, Heidelberg (2006)"},{"issue":"1","key":"11_CR82","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.entcs.2005.12.028","volume":"150","author":"CL Talcott","year":"2006","unstructured":"Talcott, C.L.: Coordination models based on a formal model of distributed object reflection. Electr. Notes Theor. Comput. Sci. 150(1), 143\u2013157 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"11_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-56883-2_12","volume-title":"Functional Programming, Concurrency, Simulation and Automated Reasoning","author":"TC Winkler","year":"1993","unstructured":"Winkler, T.C.: Programming in OBJ and Maude. In: Lauer, P.E. (ed.) Functional Programming, Concurrency, Simulation and Automated Reasoning. LNCS, vol. 693, pp. 229\u2013277. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Logic, Rewriting, and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23165-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:40:04Z","timestamp":1748580004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23165-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231648","9783319231655"],"references-count":83,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23165-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}