Making Maude Definitions More Interactive

  • Andrei Arusoaie
  • Traian Florin Şerbănuţă
  • Chucky Ellison
  • Grigore Roşu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7571)


This paper presents an interface for achieving interactive executions of Maude terms by allowing console and file input/output (I/O) operations. This interface consists of a Maude API for I/O operations, a Java-based server offering I/O capabilities, and a communication protocol between the two implemented using the external objects concept and Maude’s TCP sockets. This interface was evaluated as part of the \(\mathbb{K}\) framework, providing interactive interpreter capabilities for executing and testing programs for multiple language definitions.


Maude interactive input/output API 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    The K semantic framework website (2010),
  2. 2.
    The Java I/O server: svn repository with full sources (2011),
  3. 3.
    The Maude I/O interface: svn repository with specification and examples (2011),
  4. 4.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude Manual (Version 2.6) (January 2011),
  5. 5.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)zbMATHGoogle Scholar
  6. 6.
    Coan, J.S.: Basic BASIC: an introduction to computer programming in BASIC language. Hayden Book Co., Rochelle Park (1978)Google Scholar
  7. 7.
    Durán, F., Riesco, A., Verdejo, A.: A distributed implementation of Mobile Maude. In: WRLA 2006. ENTCS, vol. 176(4), pp. 113–131 (2007)Google Scholar
  8. 8.
    Ellison, C., Roşu, G.: An executable formal semantics of C with applications. In: POPL 2012. ACM (to appear, 2012)Google Scholar
  9. 9.
    FSF: C language testsuites: C-torture version 4.4.2 (2010),
  10. 10.
    Meredith, P., Hills, M., Roşu, G.: An executable rewriting logic semantics of K-Scheme. In: SCHEME 2007, pp. 91–103 (2007)Google Scholar
  11. 11.
    Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73–155 (1992)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Meseguer, J., Braga, C.: Modular Rewriting Semantics of Programming Languages. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 364–378. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  13. 13.
    Peyton Jones, S.L., Wadler, P.: Imperative functional programming. In: POPL 1993, pp. 71–84 (1993)Google Scholar
  14. 14.
    Roşu, G., Ştefănescu, A.: Matching logic: A new program verification approach. In: ICSE 2011 (NIER Track), pp. 868–871 (2011)Google Scholar
  15. 15.
    Roşu, G., Ellison, C., Schulte, W.: Matching Logic: An Alternative to Hoare/Floyd Logic. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 142–162. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  16. 16.
    Roşu, G., Şerbănuţă, T.F.: An overview of the K semantic framework. J. of Logic and Algebraic Programming 79(6), 397–434 (2010)zbMATHCrossRefGoogle Scholar
  17. 17.
    Şerbănuţă, T.F., Roşu, G., Meseguer, J.: A rewriting logic approach to operational semantics. Information and Computation 207, 305–340 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Şerbănuţă, T.F., Roşu, G.: K-Maude: A Rewriting Based Tool for Semantics of Programming Languages. In: Ölveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 104–122. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Andrei Arusoaie
    • 1
  • Traian Florin Şerbănuţă
    • 1
    • 2
  • Chucky Ellison
    • 2
  • Grigore Roşu
    • 2
  1. 1.University Alexandru Ioan Cuza of IaşiRomania
  2. 2.University of Illinois at Urbana-ChampaignUSA

Personalised recommendations