Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

The theory and applications of rewriting logic have been vigorously developed by
researchers all over the world during the past eleven years. The attached bibliography …

This chapter describes some existing Maude-based tools that are available for download.
The first section describes tools concerned with analysis of either Maude specifications, or of …

Maude is a high-level language and a high-performance system supporting executable
specification and declarative programming in rewriting logic. Since rewriting logic contains …

This paper gives an overview of the Maude 2.0 system. We emphasize the full generality
with which rewriting logic and membership equational logic are supported, operational …

Rewriting logic [40] is proposed as a logical framework in which other logics can be
represented, and as a semantic framework for the specification of languages and systems …

Distributed systems are often modeled by objects that run concurrently, each with its own
processor, and communicate by synchronous remote method calls. This may be satisfactory …

This introduction tries to give the big picture on the goals, design philosophy, logical
foundations, applications, and overall structure of Maude. It is written in an impressionistic …

Rewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite
theories involve the specification of equational theories of data and state structures together …

Abstract The Model Driven Architecture necessitates not only the application of software
engineering disciplines to the specification of modeling languages (language-ware) but also …