With much fanfare, Foreign Affairs, Trade and Development Canada announced that trade negotiators have concluded negotiations on the Canada-European Union Comprehensive Economic and Trade Agreement (CETA), even organizing a signing ceremony with the provinces on September 26 to “finalize” the deal.
As you probably can tell Maude sets out to solve a different set of problems than ordinary imperative languages. It is a formal reasoning tool, which can help us verify that things are "as they should", and show us why they are not if this is the case. Maude lets us define formally what we mean by some concept in a very abstract manner, but we can describe what is thought to be the equal concerning our theory (equations) and what state changes it can go through (rewrite rules). This is useful to validate security protocols and critical code. The Maude system has proved flaws in cryptography protocols by just specifying what the system can do , and by looking for unwanted situations the protocol can be showed to contain bugs, not programming bugs but situations happen that are hard to predict just by walking down the "happy path" as most developers do. We can use Maude's built-in search to look for unwanted states, or it can be used to show that no such states can be reached.
One of the key goals of rewriting logic from its beginning has been to provide a semantic and logical framework in which many models of computation and languages can be naturally represented. There is by now very extensive evidence supporting the claim that rewriting logic is indeed a very flexible and simple logical and semantic framework. From a language design point of view the obvious question to ask is: how can a rewriting logic language best support logical and semantic framework applications, so that it becomes a metalanguage in which a very wide variety of logics and languages can be both semantically defined, and implemented? Our answer is: by being reflective. This paper discusses our latest language design and implementation work on Maude as a reflective metalanguage in which entire environments---including syntax definition, parsing, pretty printing, execution, and input/output---can be defined for a language or logic L of choice.
Introduction to Maude: ToC This is the ToC of the Algebraic Specification of Hardware and Software module. The first part contains the Introduction to Maude course; the second (when written) will contain the Microprocessor Verification course. The first (non-technical) section is here (PDF). It outlines the contents of the course. 1. Term Rewriting (PDF) 2. Basic Maude (PDF) 3. Sort Hierarchies and Membership Axioms (PDF) 4. A Microprocessor Example (PDF)
U. Lechner, C. Lengauer, and M. Wirsing. Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification, 906, page 351--367. London, UK, Springer-Verlag, (1995)