The Maude Formal Tool Environment

  • Manuel Clavel
  • Francisco Durán
  • Joe Hendrix
  • Salvador Lucas
  • José Meseguer
  • Peter Ölveczky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4624)


This paper describes the main features of several tools concerned with the analysis of either Maude specifications, or of extensions of such specifications: the ITP, MTT, CRC, ChC, and SCC tools, and Real-Time Maude for real-time systems. These tools, together with Maude itself and its searching and model-checking capabilities, constitute Maude’s formal environment.


Decision Procedure Critical Pair Proof Obligation Tree Automaton Equational Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.: Maude: specification and programming in rewriting logic. Th. Comp. Sci. 285(2), 187–243 (2002)zbMATHCrossRefGoogle Scholar
  2. 2.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.L.: All About Maude, A High-Performance Logical Framework. LNCS, vol. 4350 (to appear)Google Scholar
  3. 3.
    Clavel, M., Durán, F., Eker, S., Meseguer, J.: Building equational proving tools by reflection in rewriting logic. In: CAFE: An Industrial-Strength Alg. Formal Method, Elsevier, Amsterdam (2000)Google Scholar
  4. 4.
    Clavel, M., Palomino, M., Riesco, A.: Introducing the ITP tool: a tutorial. J. of Universal Computer Science 12(11), 1618–1650 (2007)Google Scholar
  5. 5.
    Clavel, M., Palomino, M., Santa-Cruz, J.: Integrating decision procedures in reflective rewriting-based theorem provers. In: Antoy, S., Toyama, Y. (eds.) Procs. WRS 2004 (2004)Google Scholar
  6. 6.
    Contejean, E., Marché, C., Monate, B., Urbain, X.: Proving termination of rewriting with CiME. In: Rubio, A. (ed.) Procs. of WST 2003, pp. 71–73 (2003)Google Scholar
  7. 7.
    Durán, F., Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving termination of membership equational programs. In: Sestoft, P., Heintze, N. (eds.) Procs. PEPM 2004 (2004)Google Scholar
  8. 8.
    Durán, F., Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving operational termination of membership equational programs. Higher-Order and Symb. Comp. (to appear)Google Scholar
  9. 9.
    Durán, F., Meseguer, J.: Maude’s Module Algebra. Science of Computer Programming 66(2), 125–153 (2007)zbMATHCrossRefGoogle Scholar
  10. 10.
    Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 281–286. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Hendrix, J., Meseguer, J.: On the completeness of context-sensitive order-sorted specifications. Tech. Report UIUCDCS-R-2007-2812, U. of Illinois (2007)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Hendrix, J., Ohsaki, H., Meseguer, J.: Sufficient completeness checking with propositional tree automata. Tech. Report UIUCDCS-R-2005-2635, U. of Illinois (2005)Google Scholar
  14. 14.
    Hendrix, J., Ohsaki, H., Viswanathan, M.: Propositional tree automata. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 50–65. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  15. 15.
    Kapur, D., Zhang, H.: An overview of rewrite rule laboratory (RRL). J. Computer and Mathematics with Applications 29(2), 91–114 (1995)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Lucas, S.: MU-TERM: A tool for proving termination of context-sensitive rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 200–209. Springer, Heidelberg (2004)Google Scholar
  17. 17.
    Marché, C., Rubio, A., Zantema, H.: The Termination Problems Data Base: format of input files (March 2005), Available at
  18. 18.
    Ölveczky, P.C., Meseguer, J.: Abstraction and completeness for Real-Time Maude. In: Procs. WRLA 2006 (2006)Google Scholar
  19. 19.
    Ölveczky, P.C., Meseguer, J.: Semantics and pragmatics of Real-Time Maude. Higher-Order and Symb. Comp. 20(1/2), 161–196 (2007)zbMATHCrossRefGoogle Scholar
  20. 20.
    Ölveczky, P.C., Meseguer, J., Talcott, C.L.: Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. Formal Methods in System Design 29, 253–293 (2006)zbMATHCrossRefGoogle Scholar
  21. 21.
    Ölveczky, P.C., Thorvaldsen, S.: Formal modeling and analysis of the OGDC wireless sensor network algorithm in Real-Time Maude. In: FMOOD 2007 (to appear)Google Scholar
  22. 22.
    Zhang, H., Kapur, D., Krishnamoorthy, M.S.: A mechanizable induction principle for equational specifications. In: Lusk, E., Overbeek, R. (eds.) 9th International Conference on Automated Deduction. LNCS, vol. 310, pp. 162–181. Springer, Heidelberg (1988)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Manuel Clavel
    • 1
  • Francisco Durán
    • 2
  • Joe Hendrix
    • 3
  • Salvador Lucas
    • 4
  • José Meseguer
    • 3
  • Peter Ölveczky
    • 5
  1. 1.Universidad Complutense de MadridSpain
  2. 2.Universidad de MálagaSpain
  3. 3.University of Illinois at Urbana-Champaign, ILUSA
  4. 4.Universidad Politécnica de ValenciaSpain
  5. 5.University of OsloNorway

Personalised recommendations