Twenty years of rewriting logic

AbstractRewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems

Tool Interoperability in the Maude Formal Environment

We 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.Presentamos 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