Skip to main content
SpringerLink
Log in

The Maude 2.0 System

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2706))

Included in the following conference series:

Abstract

This paper gives an overview of the Maude 2.0 system. We emphasize the full generality with which rewriting logic and membership equational logic are supported, operational semantics issues, the new built-in modules, the more general Full Maude module algebra, the new META-LEVEL module, the LTL model checker, and new implementation techniques yielding substantial performance improvements in rewriting modulo. We also comment on Maude’s formal tool environment and on applications.

Research supported by DARPA through Air Force Research Laboratory Contract F30602-02-C-0130, ONR Grant N00014-02-1-0715, NSF grants CCR-9900326, CCR-0234603 and CCR-0234524, and by CICYT projects TIC 2000-0701-C02-01 and TIC 2001-2705-C03-02.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Borovanský, C. Kirchner, H. Kirchner, and P.-E. Moreau. ELAN from a rewriting logic point of view. Theoretical Computer Science, 285:155–185, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Bruni and J. Meseguer. Generalized rewrite theories. To appear in Procs. of ICALP’03. LNCS. Springer, 2003.

    Google Scholar 

  3. M. Clavel. Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications. CSLI Publications, 2000.

    Google Scholar 

  4. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude Manual, 1999. http://maude.cs.uiuc.edu.

  5. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. The Maude system. In Procs. of RTA’99. LNCS 1631, pp. 240–243. Springer, 1999.

    Google Scholar 

  6. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J. Quesada. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187–243, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Clavel, F. Durán, S. Eker, J. Meseguer, and M.-O. Stehr. Maude as a formal meta-tool. In Procs. of FM’99. LNCS 1709, pp. 1684–1703. Springer, 1999.

    Google Scholar 

  8. M. Clavel and J. Meseguer. Reflection in conditional rewriting logic. Theoretical Computer Science, 285:245–288, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent. Journal of Computer and System Science, 38:86–124, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  10. S. Eker. Term rewriting with operator evaluation strategy. In Procs. of WRLA’98. ENTCS 15. Elsevier, 1998.

    Google Scholar 

  11. S. Eker. Associative-commutative rewriting on large terms. This volume.

    Google Scholar 

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

    Google Scholar 

  13. S. Eker, M. Knapp, K. Laderoute, P. Lincoln, and C. Talcott. Pathway logic: Executable models of biological networks. In Procs. of WRLA’02. ENTCS 71. Elsevier, 2002.

    Google Scholar 

  14. K. Etessami and G. J. Holzmann. Optimizing Büchi automata. In Procs. of CONCUR’00. LNCS 1877, pp. 153–167. Springer, 2000.

    Google Scholar 

  15. K. Futatsugi and R. Diaconescu. CafeOBJ Report. World Scientific, AMAST Series, 1998.

    Google Scholar 

  16. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. In Procs. of CAV’01. LNCS 2102, pp. 53–65. Springer, 2001.

    Google Scholar 

  17. 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–18. Chapman and Hall, 1995.

    Google Scholar 

  18. G.J. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. Design: An International Journal, 13(3):289–307, 1998.

    Google Scholar 

  19. S. Lucas. Termination of rewriting with strategy annotations. In Procs. of LPAR’01. LNAI 2250, pp. 669–684. Springer, 2001.

    Google Scholar 

  20. N. Martí-Oliet and J. Meseguer. Rewriting logic: roadmap and bibliography. Theoretical Computer Science, 285:121–154, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  21. J. Meseguer, M. Palomino, and N. Martí-Oliet. Equational abstractions. To appear in Procs. of CADE’03. LNCS. Springer, 2003.

    Google Scholar 

  22. J. Meseguer. Membership algebra as a logical framework for equational specification. In Procs. of WADT’97. LNCS 1376, pp. 18–61. Springer, 1998.

    Google Scholar 

  23. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Procs. of CAV’00. LNCS 1633, pp. 247–263. Springer, 2000.

    Google Scholar 

  24. C. Talcott. To be presented at the DARPA FTN Winter 2003 PI meeting, TX, USA, 2003.

    Google Scholar 

  25. P. Thati, K. Sen, and N. Martí-Oliet. An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0. In Procs. of WRLA’02. ENTCS 71. Elsevier, 2002.

    Google Scholar 

  26. A. Verdejo and N. Martí-Oliet. Implementing CCS in Maude 2. In Procs. of WRLA’02. ENTCS 71. Elsevier, 2002.

    Google Scholar 

  27. P. Viry. Equational rules for rewriting logic. Theoretical Computer Science, 285:487–517, 2002.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad Complutense de Madrid, Spain

    Manuel Clavel & Narciso Martí-Oliet

  2. Universidad de Málaga, Spain

    Francisco Durán

  3. SRI International, CA, USA

    Steven Eker, Patrick Lincoln & Carolyn Talcott

  4. University of Illinois at Urbana-Champaign, IL, USA

    José Meseguer

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. Patrick Lincoln
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Narciso Martí-Oliet
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. José Meseguer
    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

Editor information

Editors and Affiliations

  1. Dpt. Lenguajes y Sistemas Informáticos (LSI), Technical University of Catalonia (UPC), Jordi Girona 1, 08034, Barcelona, Spain

    Robert Nieuwenhuis

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clavel, M. et al. (2003). The Maude 2.0 System. In: Nieuwenhuis, R. (eds) Rewriting Techniques and Applications. RTA 2003. Lecture Notes in Computer Science, vol 2706. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44881-0_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44881-0_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40254-1

  • Online ISBN: 978-3-540-44881-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation