Mostrar el registro sencillo del ítem

dc.contributor.authorDurán, Francisco
dc.contributor.authorRocha, Camilo
dc.contributor.authorÁlvarez, José María
dc.date.accessioned2021-12-03T17:29:14Z
dc.date.available2021-12-03T17:29:14Z
dc.date.issued2011
dc.identifier.isbn9783642229442
dc.identifier.issn9783642229435
dc.identifier.urihttps://repositorio.escuelaing.edu.co/handle/001/1897
dc.description.abstractWe present the Maude Formal Environment (MFE), an executable formal specification in Maude within which a user can seamlessly interact with the Maude Termination Tool, the Maude Sufficient Completeness Checker, the Church-Rosser Checker, the Coherence Checker, and the Maude Inductive Theorem Prover. We explain the high-level design decisions behind MFE, give a summarized account of its main features, and illustrate with an example the interoperation of the tools available in its current release.eng
dc.description.abstractPresentamos Maude Formal Environment (MFE), una especificación formal ejecutable en Maude dentro de la cual un usuario puede interactuar sin problemas con la herramienta de terminación de Maude, el verificador de integridad suficiente de Maude, el verificador de Church-Rosser, el verificador de coherencia y el teorema inductivo de Maude. Tirador de pruebas. Explicamos las decisiones de diseño de alto nivel detrás de MFE, brindamos una descripción resumida de sus características principales e ilustramos con un ejemplo la interoperabilidad de las herramientas disponibles en su versión actual.ESP
dc.format.extent7 páginas.spa
dc.format.mimetypeapplication/pdfspa
dc.language.isoengspa
dc.publisherSpringerspa
dc.relation.ispartofseriesLecture Notes in Computer Science;6859
dc.rights© Springer-Verlag Berlin Heidelberg 2011eng
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/spa
dc.titleTool Interoperability in the Maude Formal Environmenteng
dc.typeCapítulo - Parte de Librospa
dc.type.versioninfo:eu-repo/semantics/publishedVersionspa
oaire.accessrightshttp://purl.org/coar/access_right/c_14cbspa
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85spa
dc.contributor.researchgroupInformáticaspa
dc.publisher.placeBerlínspa
dc.relation.citationendpage406spa
dc.relation.citationstartpage400spa
dc.relation.indexedN/Aspa
dc.relation.ispartofbookAlgebra and Coalgebra in Computer Scienceeng
dc.relation.referencesClavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Bevilacqua, V., 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)spa
dc.relation.referencesClavel, 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)spa
dc.relation.referencesClavel, 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)spa
dc.relation.referencesClavel, M., Palomino, M., Riesco, A.: Introducing the ITP tool: a tutorial. Journal of Universal Computer Science 12(11), 1618–1650 (2006)spa
dc.relation.referencesDurán, F., Lucas, S., Meseguer, J.: 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)spa
dc.relation.referencesDurán, F., Meseguer, J.: Maude’s module algebra. Science of Computer Programming 66(2), 125–153 (2007)spa
dc.relation.referencesDurán, F., Meseguer, J.: A church-rosser checker tool for conditional order-sorted equational maude specifications. In: Ölveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 69–85. Springer, Heidelberg (2010)spa
dc.relation.referencesDurán, F., Meseguer, J.: A maude coherence checker tool for conditional order-sorted rewrite theories. In: Ölveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 86–103. Springer, Heidelberg (2010)spa
dc.relation.referencesDurán, F., Meseguer, J.: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. Journal of Logic and Algebraic Programming Journal of Logic and Algebraic Programming (2011) (accepted for publication)spa
dc.relation.referencesEker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL model checker. In: Gaducci, F., Montanari, U. (eds.) Proceedings of 4th International Workshop on Rewriting Logic and its Applications (WRLA 2002). Electronic Notes in Theoretical Computer Science, vol. 71 (2002)spa
dc.relation.referencesHendrix, J.: Decision Procedures for Equationally Based Reasoning. Ph.D. thesis. University of Illinois at Urbana-Champaign (2008)spa
dc.relation.referencesRocha, 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)spa
dc.relation.referencesRocha, C., Meseguer, J.: Proving safety properties of rewrite theories. Tech. rep. University of Illinois at Urbana-Champaign (2010), http://hdl.handle.net/2142/17407spa
dc.rights.accessrightsinfo:eu-repo/semantics/closedAccessspa
dc.rights.creativecommonsAtribución 4.0 Internacional (CC BY 4.0)spa
dc.subject.armarcMaudeENG
dc.subject.armarcPar críticoESP
dc.subject.armarcObligación de pruebaESP
dc.subject.armarcParte FuncionalESP
dc.subject.armarcHerramienta activaESP
dc.subject.armarcObjetivo de terminaciónESP
dc.subject.proposalCritical Paireng
dc.subject.proposalProof Obligationeng
dc.subject.proposalFunctional Parteng
dc.subject.proposalActive Tooleng
dc.subject.proposalTermination Goaleng
dc.type.coarhttp://purl.org/coar/resource_type/c_3248spa
dc.type.contentTextspa
dc.type.driverinfo:eu-repo/semantics/bookPartspa
dc.type.redcolhttp://purl.org/redcol/resource_type/ARTspa


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

© Springer-Verlag Berlin Heidelberg 2011
Excepto si se señala otra cosa, la licencia del ítem se describe como © Springer-Verlag Berlin Heidelberg 2011