Unification and Narrowing in Maude 2.4

Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications, and has a relatively large worldwide user and open-source developer base. This paper introduces novel features of Maude 2.4 including support for unification and narrowing. Unification is supported in Core Maude, the core rewriting engine of Maude, with commands and metalevel functions for order-sorted unification modulo some frequently occurring equational axioms. Narrowing is currently supported in its Full Maude extension. We also give a brief summary of the most important features of Maude 2.4 that were not part of Maude 2.0 and earlier releases. These features include communication with external objects, a new implementation of its module algebra, and new predefined libraries. We also review some new Maude applications.

[1]  Evelyne Contejean,et al.  A new AC unification algorithm with an algorithm for solving systems of diophantine equations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[2]  José Meseguer,et al.  The Rewriting Logic Semantics Project , 2006, Electron. Notes Theor. Comput. Sci..

[3]  José Meseguer,et al.  Towards a Strategy Language for Maude , 2005, WRLA.

[4]  Leon Sterling,et al.  Meta-Level Inference and Program Verification , 1982, CADE.

[5]  José Meseguer,et al.  A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties , 2006, Theor. Comput. Sci..

[6]  Artur Boronat,et al.  An Algebraic Semantics for MOF , 2008, FASE.

[7]  José Meseguer,et al.  Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols , 2007, High. Order Symb. Comput..

[8]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[9]  José Meseguer,et al.  Symbolic Model Checking of Infinite-State Systems Using Narrowing , 2007, RTA.

[10]  Claude Kirchner,et al.  Incremental Construction of Unification Algorithms in Equational Theories , 1983, ICALP.

[11]  Francisco Durán,et al.  Maude's module algebra , 2007, Sci. Comput. Program..

[12]  Narciso Martí-Oliet,et al.  The Maude 2.0 System , 2003, RTA.

[13]  José Meseguer,et al.  Variant Narrowing and Equational Unification , 2009, WRLA.

[14]  Emanuele Viola.  E-unifiability via Narrowing , 2001, ICTCS.

[15]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

[16]  José Meseguer,et al.  Effectively Checking the Finite Variant Property , 2008, RTA.

[17]  S TraianFlorin.  A Rewriting Logic Approach to Operational Semantics , 2010 .

[18]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[19]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[20]  Narciso Martí-Oliet,et al.  The Maude System , 1999, RTA.

[21]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[22]  María Alpuente,et al.  Modular Termination of Basic Narrowing , 2008, RTA.

[23]  Stéphanie Delaune,et al.  The Finite Variant Property: How to Get Rid of Some Algebraic Properties , 2005, RTA.

[24]  Evelyne Contejean,et al.  An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations , 1994, Inf. Comput..

[25]  Antonio Vallecillo,et al.  Adding Behavioral Semantics to Models , 2007 .