Publication:
Towards a Maude Formal Environment

Thumbnail Image
Files

Files

Towards a Maude Formal Environment.pdf (185.09 KB)
View Statistics
Reference Managers
Mendeley
Indexers
Google Scholar CORE
QR Code
QR Code
Authors

Authors

Durán, Francisco
Rocha, Camilo
Álvarez, José María
Abstract (Spanish)
Maude es un lenguaje declarativo y reflexivo basado en una lógica de reescritura en la que el cómputo corresponde a una deducción eficiente por reescritura. Debido a sus capacidades reflexivas, Maude ha resultado útil como metaherramienta en el desarrollo de herramientas de análisis formal para verificar propiedades específicas de las especificaciones de Maude. Esto incluye herramientas para verificar la terminación, la confluencia y las propiedades inductivas de las teorías de reescritura. Sin embargo, la mayoría de estas herramientas han sido diseñadas para funcionar de forma aislada, lo que dificulta, por ejemplo, el intercambio de datos entre ellas y dificulta el cambio entre sus entornos. Este documento presenta Maude Formal Environment (MFE), una especificación formal ejecutable en Maude dentro de la cual un usuario puede interactuar con herramientas para verificar mecánicamente las propiedades de las especificaciones de Maude. Un aspecto importante de este trabajo es que el MFE ha sido diseñado para ser ampliado fácilmente con herramientas que tienen diseños muy heterogéneos, creando sinergia entre ellos. Como prueba de concepto, informamos sobre la integración de cinco herramientas de análisis formales de uso común para las especificaciones de Maude en MFE e ilustramos su interoperabilidad con un ejemplo.
Abstract (English)
Maude is a declarative and reflective language based on rewriting logic in which computation corresponds to efficient deduction by rewriting. Because of its reflective capabilities, Maude has been useful as a metatool in the development of formal analysis tools for checking specific properties of Maude specifications. This includes tools for checking termination, confluence, and inductive properties of rewrite theories. Nevertheless, most of these tools have been designed to work in isolation, making it difficult, for instance, to exchange data between them and inconvenient to switch between their environments. This paper presents the Maude Formal Environment (MFE), an executable formal specification in Maude within which a user can interact with tools to mechanically verify properties of Maude specifications. One important aspect of this work is that the MFE has been designed to be easily extended with tools having highly heterogeneous designs whilst creating synergy among them. As a proof of concept, we report on the integration of five commonly used formal analysis tools for Maude specifications into MFE and illustrate their interoperability with an example.
Extent
22 páginas.
Rights

© Springer-Verlag Berlin Heidelberg 2011

URI: https://repositorio.escuelaing.edu.co/handle/001/1890
Collections

Collections

AD - CTG – Informática
References

User interfaces for theorem provers, http://www.informatik.uni-bremen.de/uitp/

Aspinall, D., Lüth, C.: Special issue on user interfaces in theorem proving. Journal of Automated Reasoning 39(2) (2007) Google Scholar

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

Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework: How to Specify, Program, and Verify Systems in Rewriting Logic. LNCS, vol. 4350. Springer, Heidelberg (2007)

Clavel, M., Durán, F., Eker, S., Meseguer, J., Stehr, M.O.: Maude as a formal meta-tool. In: Wing, J.M., Woodcock, J., Davies, J. (eds.) FM 1999. LNCS, vol. 1709, pp. 1684–1703. Springer, Heidelberg (1999)

Clavel, M., Durán, F., Hendrix, J., Lucas, S., Meseguer, J., Ölveczky, P.: The Maude formal tool environment. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 173–178. Springer, Heidelberg (2007)

Clavel, M., Palomino, M., Riesco, A.: Introducing the ITP tool: a tutorial. Journal of Universal Computer Science 12(11), 1618–1650 (2006)

Durán, F., Lucas, S., Bevilacqua, V.: MTT: The Maude termination tool (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 313–319. Springer, Heidelberg (2008)

Durán, F., Lucas, S., Meseguer, J.: Methods for proving termination of rewriting-based programming languages by transformation. Electronic Notes in Theoretical Computer Science 248, 93–113 (2009)

Durán, F., Lucas, S., Meseguer, J.: Termination modulo combinations of equational theories. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol. 5749, pp. 246–262. Springer, Heidelberg (2009)

Durán, F., Meseguer, J.: A Church-Rosser checker tool for conditional order-sorted equational Maude specifications. In: Ölveczky, P. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 69–85. Springer, Heidelberg (2010)

Durán, F., Meseguer, J.: A Maude coherence checker tool for conditional order-sorted rewrite theories. In: Ölveczky, P. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 86–103. Springer, Heidelberg (2010)

Durán, F., Meseguer, J.: Maude’s module algebra. Science of Computer Programming 66(2), 125–153 (2007)

Durán, F., Meseguer, J.: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. Journal of Logic and Algebraic Programming (submitted for publication, 2011)

Durán, F., Ölveczky, P.C.: A guide to extending Full Maude illustrated with the implementation of Real-Time Maude. Electronic Notes in Theoretical Computer Science 238(3), 83–102 (2009)

Franssen, M., van den Brand, M.: Design of a proof repository architecture. In: Proceedings of the 1st Workshop on Modules and Libraries for Proof Assistants (MLPA 2009), pp. 19–23. ACM (2009)

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)

Hemer, D., Long, G., Strooper, P.: Plug-in proof support for formal development environments. In: Proceedings of the 2005 Australasian Symposium on Theory of Computing (CATS 2005), pp. 69–79. Australian Computer Society, Inc. (2005)

Hendrix, J.: Decision Procedures for Equationally Based Reasoning. Ph.D. thesis, University of Illinois at Urbana-Champaign (2008)

Hendrix, J., Clavel, M., Bevilacqua, V.: A sufficient completeness reasoning tool for partial specifications. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 165–174. Springer, Heidelberg (2005)

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)

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)

Mossakowski, T., Maeder, C., Lüttich, K.: The heterogeneous tool set, Hets. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 519–522. Springer, Heidelberg (2007)

Rocha, C., Meseguer, J.: Constructors, sufficient completeness and deadlock freedom of rewrite theories. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 594–609. Springer, Heidelberg (2010)