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 …

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 …

This paper is part of a long-term effort to increase expressiveness of algebraic specification
languages while at the same time having a simple semantic foundation on which efficient …

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 …

A model checker typically supports two different levels of specification:(1) a system
specification level, in which the concurrent system to be analyzed is formalized; and (2) a …