Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
The K semantic framework website (2010), https://k-framework.googlecode.com
The Java I/O server: svn repository with full sources (2011), https://k-framework.googlecode.com/svn/trunk/core/java
The Maude I/O interface: svn repository with specification and examples (2011), http://k-framework.googlecode.com/svn/branches/inProgress/core/io
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude Manual (Version 2.6) (January 2011), http://maude.cs.uiuc.edu/maude2-manual/
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)
Coan, J.S.: Basic BASIC: an introduction to computer programming in BASIC language. Hayden Book Co., Rochelle Park (1978)
Durán, F., Riesco, A., Verdejo, A.: A distributed implementation of Mobile Maude. In: WRLA 2006. ENTCS, vol. 176(4), pp. 113–131 (2007)
Ellison, C., Roşu, G.: An executable formal semantics of C with applications. In: POPL 2012. ACM (to appear, 2012)
FSF: C language testsuites: C-torture version 4.4.2 (2010), http://gcc.gnu.org/onlinedocs/gccint/C-Tests.html
Meredith, P., Hills, M., Roşu, G.: An executable rewriting logic semantics of K-Scheme. In: SCHEME 2007, pp. 91–103 (2007)
Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73–155 (1992)
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)
Peyton Jones, S.L., Wadler, P.: Imperative functional programming. In: POPL 1993, pp. 71–84 (1993)
Roşu, G., Ştefănescu, A.: Matching logic: A new program verification approach. In: ICSE 2011 (NIER Track), pp. 868–871 (2011)
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)
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)
Şerbănuţă, T.F., Roşu, G., Meseguer, J.: A rewriting logic approach to operational semantics. Information and Computation 207, 305–340 (2009)
Ş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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arusoaie, A., Şerbănuţă, T.F., Ellison, C., Roşu, G. (2012). Making Maude Definitions More Interactive. In: Durán, F. (eds) Rewriting Logic and Its Applications. WRLA 2012. Lecture Notes in Computer Science, vol 7571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34005-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-34005-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34004-8
Online ISBN: 978-3-642-34005-5
eBook Packages: Computer ScienceComputer Science (R0)