Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Two Decades of Maude

  • Chapter
  • First Online:
Logic, Rewriting, and Concurrency

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9200))

Abstract

This paper is a tribute to José Meseguer, from the rest of us in the Maude team, reviewing the past, the present, and the future of the language and system with which we have been working for around two decades under his leadership. After reviewing the origins and the language’s main features, we present the latest additions to the language and some features currently under development. This paper is not an introduction to Maude, and some familiarity with it and with rewriting logic are indeed assumed.

Dedicado a José Meseguer, con ocasión de su 65 cumpleaños, con cariño, amistad y agradecimiento por todo el trabajo realizado conjuntamente en estas dos décadas.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    The original solution assumes that lists are created using an associative symbol, but unification modulo associativity is infinitary and it is not available in Maude. The _*_ operator is therefore not declared associative.

  2. 2.

    There are in fact two internal syntactic forms for representing cell state: a soup of locations; and a soup of occurrences. We restrict attention to the latter as occurrences correspond to places in a Petri net.

  3. 3.

    Rules are currently inferred by a human curator.

References

  1. Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. J. ACM 47(4), 776–822 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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–26 June 2013. LIPIcs, vol. 21, pp. 81–96. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)

    Google Scholar 

  3. Bae, K., Krisiloff, J., Meseguer, J., Ölveczky, P.C.: Designing and verifying distributed cyber-physical systems using multirate PALS: an airplane turning control system case study. Sci. Comput. Program. 103, 13–50 (2015)

    Article  Google Scholar 

  4. Bae, K., Meseguer, J.: Model checking linear temporal logic of rewriting formulas under localized fairness. Sci. Comput. Program. 99, 193–234 (2015)

    Article  Google Scholar 

  5. Barrett, C., Conway, C.L., Deters, M., Hadarean, L., Jovanović, D., King, T., Reynolds, A., Tinelli, C.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 171–177. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. 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

  7. 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–885. IOS Press (2009)

    Google Scholar 

  8. Boronat, A., Meseguer, J.: An algebraic semantics for MOF. Formal Asp. Comput. 22(3–4), 269–296 (2010)

    Article  MATH  Google Scholar 

  9. Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic. Theor. Comput. Sci. 236(1), 35–132 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Brands, S., Chaum, D.: Distance bounding protocols. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 344–359. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  11. Cerioli, M., Meseguer, J.: May i borrow your logic? (Transporting logical structure along maps). Theor. Comput. Sci. 173, 311–347 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. 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

    Google Scholar 

  13. Clavel, M.: Reflection in general logics, rewriting logic, and Maude. In: Kirchner, Kirchner (eds.) [53], pp. 71–82

    Google Scholar 

  14. Clavel, M., Durán, F., Eker, S., Escobar, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Unification and narrowing in Maude 2.4. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 380–390. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J.: Metalevel computation in Maude. In: Kirchner and Kirchner [53], pp. 331–352

    Google Scholar 

  16. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-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/

  17. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude as a metalanguage. In: Kirchner and Kirchner [53], pp. 147–160

    Google Scholar 

  18. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: The Maude system. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 240–243. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-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

    Google Scholar 

  20. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Towards Maude 2.0. In: Futatsugi [45], pp. 294–315

    Google Scholar 

  21. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Using Maude. In: Maibaum, T. (ed.) FASE 2000. LNCS, vol. 1783, pp. 371–374. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2), 187–243 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  23. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.L.: The Maude 2.0 system. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 76–87. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  25. Clavel, M., Eker, S., Lincoln, P., Meseguer, J.: Principles of Maude. In: Meseguer [67], pp. 65–89

    Google Scholar 

  26. Clavel, M., Meseguer, J.: Reflection and strategies in rewriting logic. In: Meseguer [67], pp. 126–148

    Google Scholar 

  27. 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–307. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  28. 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–421. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  29. Durán, F.: A Reflective Module Algebra with Applications to the Maude Language. Ph.D. thesis, Universidad de Málaga, Spain, June 1999

    Google Scholar 

  30. Durán, F.: The extensibility of Maude’s module algebra. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 422–437. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  31. Durán, F., Eker, S., Escobar, S., Meseguer, J., Talcott, C.L.: Variants, unification, narrowing, and symbolic reachability in Maude 2.6. In: Schmidt-Schauß, 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–40. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)

    Google Scholar 

  32. Durán, 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–85. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  33. Durán, 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–319. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  34. Durán, F., Meseguer, J.: An extensible module algebra for Maude. In: Kirchner and Kirchner [53], pp. 174–195

    Google Scholar 

  35. Durán, F., Meseguer, J.: Maude’s module algebra. Sci. Comput. Program. 66(2), 125–153 (2007)

    Article  MATH  Google Scholar 

  36. Durán, F., Meseguer, J.: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. J. Logic Algebraic Program. 81(7–8), 816–850 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  37. Durán, F., Riesco, A., Verdejo, A.: A distributed implementation of mobile Maude. Electr. Notes Theor. Comput. Sci. 176(4), 113–131 (2007)

    Article  Google Scholar 

  38. Durán, F., Rocha, C., Álvarez, 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–351. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  39. 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–412, January 2002

    Google Scholar 

  40. Escobar, S.: Functional logic programming in Maude. In: Iida, S., Meseguer, J., Ogata, K. (eds.) Specification, Algebra, and Software. LNCS, vol. 8373, pp. 315–336. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  41. 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–50. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  42. Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153–168. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  43. Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. J. Logic Algebraic Program. 81(7–8), 898–928 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  44. Fadlisyah, M., Ölveczky, P.C., Ábrahám, 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–127 (2015)

    Article  Google Scholar 

  45. Futatsugi, K. (ed.): Proceedings of the Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, 18–20 September 2000. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2000)

    Google Scholar 

  46. 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–363. Prentice-Hall (1986)

    Google Scholar 

  47. Goguen, J., Meseguer, J.: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theor. Comput. Sci. 105, 217–273 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  48. 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–167. Kluwer Academic Publishers (2000)

    Google Scholar 

  49. Goguen, J.A., Meseguer, J.: Equality, types, modules, and (why not?) generics for logic programming. J. Logic Program. 1(2), 179–210 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  50. 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–155. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  51. 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–322. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)

    Google Scholar 

  52. 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–279. Springer, Heidelberg (2015)

    Google Scholar 

  53. Kirchner, C, Kirchner, H. (eds.) Proceedings of the Second International Workshop on Rewriting Logic and its Applications, WRLA 1998, Pont-à-Mousson, France, 1–4 September 1998. Electronic Notes in Theoretical Computer Science, vol. 15. Elsevier, Amsterdam (1998)

    Google Scholar 

  54. Lincoln, P., Martí-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–11 May 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 18, pp. 309–339. American Mathematical Society (1994)

    Google Scholar 

  55. Lincoln, P., Martí-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–48. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  56. Lincoln, P.D., Talcott, C.: Symbolic systems biology and pathway logic. In: Iyengar, S. (eds.) Symbolic Systems Biology, pp. 1–29. Jones and Bartlett (2010)

    Google Scholar 

  57. Lucas, S.: Context-sensitive rewriting strategies. Inf. Comput. 178(1), 294–343 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  58. Martí-Oliet, N., Meseguer, J.: Action and change in rewriting logic. In: Pareschi, R., Fronhöfer, B. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management. Applied Logic Series, vol. 12, pp. 1–53. Kluwer Academic Publishers (1999)

    Google Scholar 

  59. Martí-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–87. Kluwer Academic Publishers (2002)

    Google Scholar 

  60. Martí-Oliet, N., Palomino, M., Verdejo, A.: Rewriting logic bibliography by topic: 1990–2011. J. Logic Algebraic Program. 81(7–8), 782–815 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  61. Mason, I.A., Talcott, C.L.: IOP: the interoperability platform & IMaude: an interactive extension of Maude. In: Martí-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications, WRLA 2004, Barcelona, Spain, 27–28 March 2004. Electronic Notes in Theoretical Computer Science, vol. 117, pp. 315–333. Elsevier (2005). http://www.sciencedirect.com/science/journal/15710661

  62. 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–25 October 1990, pp. 101–115. ACM Press (1990)

    Google Scholar 

  63. 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–400. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  64. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73–155 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  65. Meseguer, J.: Multiparadigm logic programming. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 158–200. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  66. 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–390. The MIT Press (1993)

    Google Scholar 

  67. Meseguer, J. (ed.) Proceedings of the First International Workshop on Rewriting Logic and its Applications, WRLA 1996, Asilomar, California, 3–6 September 1996. Electronic Notes in Theoretical Computer Science, vol. 4. Elsevier, Amsterdam (1996)

    Google Scholar 

  68. 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–372. Springer, Heidelberg (1996)

    Google Scholar 

  69. Meseguer, J.: Membership algebra as a logical framework for equationalspecification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18–61. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  70. 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–280. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  71. 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–382. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  72. Meseguer, J.: Twenty years of rewriting logic. J. Logic Algebraic Program. 81(7–8), 721–781 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  73. Meseguer, J., Talcott, C.: Semantic models for distributed object reflection. In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 1–36. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  74. Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. High.-Order Symbolic Comput. 20(1–2), 123–160 (2007)

    Article  MATH  Google Scholar 

  75. Meseguer, J., Winkler, T.C.: Parallel programmming in Maude. In: Banâtre, J.-P., Le Métayer, D. (eds.) Research Directions in High-Level Parallel Programming Languages 1991. LNCS, vol. 574. Springer, Heidelberg (1992)

    Google Scholar 

  76. Ölveczky, P.C., Meseguer, J.: Semantics and pragmatics of real-time Maude. High.-Order Symbolic Comput. 20(1–2), 161–196 (2007)

    Article  MATH  Google Scholar 

  77. Rivera, J.E., Durán, F., Vallecillo, A.: Formal specification and analysis of domain specific models using Maude. Simulation 85(11–12), 778–792 (2009)

    Article  Google Scholar 

  78. Rocha, C., Meseguer, J., Muñoz, C.: Rewriting modulo SMT and open system analysis. In: Escobar, S. (ed.) WRLA 2014. LNCS, vol. 8663, pp. 247–262. Springer, Heidelberg (2014)

    Google Scholar 

  79. Schmidt, K.: LoLA: a low level analyser. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 465–474. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  80. 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–1665 (2006)

    Google Scholar 

  81. 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–245. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  82. Talcott, C.L.: Coordination models based on a formal model of distributed object reflection. Electr. Notes Theor. Comput. Sci. 150(1), 143–157 (2006)

    Article  Google Scholar 

  83. 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–277. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

Download references

Acknowledgements

Francisco Durán was partially supported by Universidad de Málaga, Campus de Excelencia Internacional Andalucía Tech and Spanish Ministry for Economy and Competitiveness (MINECO) and the European Union (FEDER) under grant POLYCIMS (ref. TIN2014–52034–R). Santiago Escobar was partially supported by the EU (FEDER) and the Spanish MINECO under grant TIN2013–45732–C4–1–P. Narciso Martí-Oliet was partially supported by Spanish MINECO under grant StrongSoft (TIN2012–39391–C04–04) and Comunidad de Madrid program N-GREENS Software (S2013/ICE-2731).

Author information

Authors and Affiliations

  1. IMDEA Software, Madrid, Spain

    Manuel Clavel

  2. Universidad de Málaga, Málaga, Spain

    Francisco Durán

  3. CSL, SRI International, Menlo Park, CA, USA

    Steven Eker, Patrick Lincoln & Carolyn Talcott

  4. DSIC-ELP, Universitat Politècnica de València, Valencia, Spain

    Santiago Escobar

  5. Facultad de Informática, Universidad Complutense de Madrid, Madrid, Spain

    Narciso Martí-Oliet

Authors
  1. Manuel Clavel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco Durán
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steven Eker
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Santiago Escobar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Patrick Lincoln
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Narciso Martí-Oliet
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Carolyn Talcott
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francisco Durán .

Editor information

Editors and Affiliations

  1. Universidad Complutense de Madrid, Madrid, Spain

    Narciso Martí-Oliet

  2. University of Oslo, Oslo, Norway

    Peter Csaba Ölveczky

  3. SRI International, Menlo Park, California, USA

    Carolyn Talcott

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Clavel, M. et al. (2015). Two Decades of Maude. In: Martí-Oliet, N., Ölveczky, P., Talcott, C. (eds) Logic, Rewriting, and Concurrency. Lecture Notes in Computer Science(), vol 9200. Springer, Cham. https://doi.org/10.1007/978-3-319-23165-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23165-5_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23164-8

  • Online ISBN: 978-3-319-23165-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation