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 …

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 …

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 …

At present, designers of real-time systems face a dilemma between expressiveness and
automatic verification: if they can specify some aspects of their system in some automaton …

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 …

Rewriting logic is a flexible and expressive logical framework that unifies algebraic
denotational semantics and structural operational semantics (SOS) in a novel way, avoiding …

Abstraction reduces the problem of whether an infinite state system satisfies a temporal logic
property to model checking that property on a finite state abstract version. The most common …

We describe conditional rewriting by means of an inference system and capture termination
as the absence of infinite inference: that is, all proof attempts must either successfully …

This paper describes in detail how to bridge the gap between theory and practice when
implementing in Maude structural operational semantics described in rewriting logic, where …