The Maude 2.0 System

  • Manuel Clavel
  • Francisco Durán
  • Steven Eker
  • Patrick Lincoln
  • Narciso Martí-Oliet
  • José Meseguer
  • Carolyn Talcott
Conference paper

DOI: 10.1007/3-540-44881-0_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2706)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Manuel Clavel
    • 1
  • Francisco Durán
    • 2
  • Steven Eker
    • 3
  • Patrick Lincoln
    • 3
  • Narciso Martí-Oliet
    • 1
  • José Meseguer
    • 4
  • Carolyn Talcott
    • 3
  1. 1.Universidad Complutense de MadridSpain
  2. 2.Universidad de MálagaSpain
  3. 3.SRI InternationalUSA
  4. 4.University of Illinois at Urbana-ChampaignUSA

Personalised recommendations