Maude: specification and programming in rewriting logic

@article{Clavel2002MaudeSA,
  title={Maude: specification and programming in rewriting logic},
  author={Manuel Clavel and Francisco Dur{\'a}n and Steven Eker and Patrick Lincoln and Narciso Mart{\'i}-Oliet and Jos{\'e} Meseguer and Jos{\'e} F. Quesada},
  journal={Theor. Comput. Sci.},
  year={2002},
  volume={285},
  pages={187-243}
}
View via Publisher
doi.org
884 Citations
Highly Influential Citations
105
Background Citations
242
Methods Citations
276
Results Citations
11

Figures and Tables from this paper

884 Citations

Reflection in conditional rewriting logic
Maude's module algebra
Plan in Maude: Specifying an Active Network Programming Language
Towards a Maude Formal Environment
TLDR
The Maude Formal Environment (MFE) is presented, an executable formal specification in Maude within which a user can interact with tools to mechanically verify properties of Maude specifications, designed to be easily extended with tools having highly heterogeneous designs whilst creating synergy among them.
Strategies and user interfaces in Maude at work
  • M. Clavel
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2003
Rewriting Logic as a Semantic Framework for Modular Structural Op-erational Semantics
TLDR
This thesis applies state-of-the art transformation technology to the scope of semantic-driven generation of programming languages interpreters, with a proven correct mapping from MSOS to RWL and the MSOS-SL Interpreter, an implementation of an interpreter for MSOS specifications.
Applicative matching logic
TLDR
This paper identifies a fragment of matching μ-logic called applicative matching logic (AML), which is much simpler and thus more appealing from a foundational perspective, yet as expressive as matching μ -logic.
Towards Behavioral Maude: Behavioral Membership Equational Logic
An Executable Rewriting Logic Semantics of K-Scheme
TLDR
The rewriting logic semantics of K-Scheme is the most complete formal definition of a language in the Scheme family that the authors are aware of, in the sense that it pro- vides definitions for more Scheme language features than any other similar attempts.
Semantic foundations for generalized rewrite theories
...
...

References

SHOWING 1-10 OF 126 REFERENCES
Metalevel computation in Maude
Parameterized Theories and Views in Full Maude 2.0
A logical theory of concurrent objects and its realization in the Maude language
TLDR
A new theory of concurrent objects is presented, and a new language, called Maude, that can be used to program concurrent object-oriented systems in an entirely declarative way using rewriting logic is created.
Reflection in conditional rewriting logic
Principles of Maude
Rewriting Logic and Maude: Concepts and Applications
TLDR
The main concepts of rewriting logic and of the Maude rewriting logic language are introduced, and a wide range of semantic framework and logical framework applications that have been developed in rewriting logic using Maude are discussed.
Conditioned Rewriting Logic as a United Model of Concurrency
Towards Maude 2.0
Executing and verifying CCS in Maude
TLDR
It is shown how the semantics of CCS can be extended to traces of actions and to the CCS weak transition relation, and the reflective properties of rewriting logic, which allow controlling the rewriting process can be used to analyze CCS processes.
Membership algebra as a logical framework for equational specification
TLDR
The paper presents the basic properties of the logic and its models, and discusses in detail how many total and partial equational specification formalisms can be represented in it, as well as the practical benefits in terms of tool reusability that this opens up for other languages, including CASL.
...
...