Maude's Internal Strategies

Strategic Re ection ?

The Maude system incorporates reeective capabilities that enable quite sophisticated strategies to be expressed very conveniently. Maude's strategy languages have been used to control the execution of large and small rewriting systems, in several areas of application. Strategies have been used to encode winning strategies for games, and can also be used for more serious purposes, such as theore...

Maude: Speciication and Programming in Rewriting Logic ?

Maude is a high-level language and a high-performance system supporting exe-cutable speciication and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational speciication and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that ha...

Maude's module algebra

Speciication, Abstraction and Veriication in a Concurrent Object-oriented Language 1

We use Maude as our speciication language and the modal-calculus as our logic. We apply to speciications in Maude a framework of abstraction and veriication based on property-preserving mappings between transition systems. Firstly, we demonstrate how to employ abstraction in veriication of object-oriented speciications of distributed systems. Secondly, we use this framework to nd classes of pro...

Proving Modal Properties of Rewrite Theories Using Maude's Metalevel

Rewriting logic is a very expressive formalism for the specification of concurrent and distributed systems; more generally, it is a logic of change. In contrast, VLRL is a modal logic built on top of rewriting logic to reason precisely about that change. Here we present a technique to mechanically prove VLRL properties of rewrite theories using the reflective capability of rewriting logic throu...