## The Maude 2.0 system (2003)

Venue: | Rewriting Techniques and Applications, Proceedings of the 14th International Conference |

Citations: | 80 - 17 self |

### BibTeX

@INPROCEEDINGS{Clavel03themaude,

author = {Manuel Clavel and Francisco Durán and Steven Eker and Patrick Lincoln and Narciso Martí-oliet and José Meseguer and Carolyn Talcott},

title = {The Maude 2.0 system},

booktitle = {Rewriting Techniques and Applications, Proceedings of the 14th International Conference},

year = {2003},

pages = {76--87},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. This paper gives an overviewof the Maude 2.0 system. We emphasize the full generality with which rewriting logic and membership equational logic are supported, operational semantics issues, the new built-in modules, the more general Full Maude module algebra, the new META-LEVEL module, the LTL model checker, and newimplementation techniques yielding substantial performance improvements in rewriting modulo. We also comment on Maude’s formal tool environment and on applications. 1

### Citations

268 | Simple on-the-fly automatic verification of linear temporal logic
- Gerth, Peled, et al.
- 1995
(Show Context)
Citation Context ...is converted to negative normal form and heuristically simplified by a set of Maude equations, mostly derived from the simplification rules in [14,23]. Rather than the classical tableaux construction =-=[17]-=-, we use a newer technique proposed in [16] based on very weak alternating automata to which we add some strongly connected component optimizations adapted from those in [23]. Throughout the computati... |

246 | Making data structures persistent
- Driscoll, Sarnak, et al.
- 1989
(Show Context)
Citation Context ... but we highlight the major ones.s84 Manuel Clavel et al. The Core Rewrite Engine. The most radical change from Maude 1.0 is the use of a novel term representation based on persistent data structures =-=[9]-=- for E-rewriting [11]. In some cases, new rewriting algorithms based on this representation can dramatically improve the rewriting speed for large terms. Table 1 compares the performance of Maude with... |

171 | Maude: specification and programming in rewriting logic
- Clavel, Duran, et al.
(Show Context)
Citation Context ...s been shown to have good properties not only for specification, but also as a declarative programming paradigm, as demonstrated by the mature implementations of the ELAN [1], CafeOBJ [15], and Maude =-=[6]-=- languages. We will focus in this paper on the main new features in Maude 2.0. We refer the reader to [4,5] for details on previous releases. Given space limitations, not even all these new features c... |

142 | Membership algebra as a logical framework for equational specification
- Meseguer
- 1997
(Show Context)
Citation Context ...t are applied modulo the equations E, the more general the underlying equational logic, the more expressive the rewriting logic. Maude 2.0’s underlying equational logic is membership equational logic =-=[22]-=-, a very expressive many-kinded Horn logic whose atomic formulas are equations t = t ′ and memberships t : s, stating that a term t has sort s. A second dimension concerns the generality of conditions... |

111 | Fast LTL to Büchi Automata Translation
- Gastin, Oddoux
- 2001
(Show Context)
Citation Context ...uristically simplified by a set of Maude equations, mostly derived from the simplification rules in [14,23]. Rather than the classical tableaux construction [17], we use a newer technique proposed in =-=[16]-=- based on very weak alternating automata to which we add some strongly connected component optimizations adapted from those in [23]. Throughout the computation, the pure propositional subformulas labe... |

103 | Efficient Büchi automata from LTL formulae
- Somenzi, Bloem
- 2000
(Show Context)
Citation Context ...for a reachable accepting cycle. The negated LTL formula is converted to negative normal form and heuristically simplified by a set of Maude equations, mostly derived from the simplification rules in =-=[14,23]-=-. Rather than the classical tableaux construction [17], we use a newer technique proposed in [16] based on very weak alternating automata to which we add some strongly connected component optimization... |

70 | On nested depth first search
- Holzmann, Peled, et al.
- 1996
(Show Context)
Citation Context ...econds Rews./second Seconds Rews./second 1000 5999 0.25 23996 0.02 299950 10000 59999 55.72 1076 0.21 285709 100000 599999 5676.44 105 2.82 212765sThe Maude 2.0 System 85 double-depth first method of =-=[18]-=- to lazily generate and search the synchronous product. 5 Formal Tools In addition to the formal methods directly supported by Maude, one can use Maude as a formal metatool to build other formal tools... |

58 | Pathway logic: Symbolic analysis of biological signaling
- Eker, Knapp, et al.
- 2002
(Show Context)
Citation Context ...de 2.0. 6 Concluding Remarks The advances in Maude 2.0 have been used to good advantage in several recent applications. The Pathway Logic project uses Maude to develop and analyze biological networks =-=[12,13]-=-. Search and model-checking are used to explore possible execution paths, and the new descent functions are used to analyze and visualize model-checking results. The ascent functions are used to trans... |

57 | Optimizing Büchi automata
- Etessami, Holzmann
- 2000
(Show Context)
Citation Context ...for a reachable accepting cycle. The negated LTL formula is converted to negative normal form and heuristically simplified by a set of Maude equations, mostly derived from the simplification rules in =-=[14,23]-=-. Rather than the classical tableaux construction [17], we use a newer technique proposed in [16] based on very weak alternating automata to which we add some strongly connected component optimization... |

57 | Rewriting logic: roadmap and bibliography
- Martí-Oliet, Meseguer
(Show Context)
Citation Context ... in rewriting modulo. We also comment on Maude’s formal tool environment and on applications. 1 Introduction Rewriting logic has been shown to have good properties as a semantic and logical framework =-=[20]-=-. The computational and logical meanings of a rewrite t → t ′ are like two sides of the same coin. Computationally, t → t ′ means that the state component t can evolve to the component t ′ . Logically... |

53 | ELAN from a rewriting logic point of view
- Borovansky, Kirchner, et al.
(Show Context)
Citation Context ...rthermore, rewriting logic has been shown to have good properties not only for specification, but also as a declarative programming paradigm, as demonstrated by the mature implementations of the ELAN =-=[1]-=-, CafeOBJ [15], and Maude [6] languages. We will focus in this paper on the main new features in Maude 2.0. We refer the reader to [4,5] for details on previous releases. Given space limitations, not ... |

35 | Generalized rewrite theories
- Bruni, Meseguer
(Show Context)
Citation Context ... equations E and rules R can be made context-sensitive. The mathematical semantics of generalized rewrite theories, and thus of modules in Maude 2.0, has been recently developed by Bruni and Meseguer =-=[2]-=-, who have given generalized rules of deduction, and have shown the existence of initial and free models and the completeness of rewriting logic deduction relative to the generalized model theory. The... |

34 | Maude as a formal meta-tool
- Clavel, Duran, et al.
- 1999
(Show Context)
Citation Context ...y critical properties. Reflection and the flexible uses of rewriting logic as a logical framework are the key features making it easy to develop such formal tools and their user interfaces. The paper =-=[7]-=- gives a detailed account of a wide range of formal tools that have been defined in Maude by different authors. Among others, we may mention: the inductive theorem prover ITP tool, the coherence check... |

32 |
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
- Clavel
- 2000
(Show Context)
Citation Context ...he execution of a rewrite theory specified as a system module will require strategies that control at the metalevel the instantiation of the extra variables in the condition and in the righthand side =-=[3]-=-. However, a quite generalsThe Maude 2.0 System 81 class of system modules, called admissible modules, are executable by Maude’s interpreter using its built-in strategies. A system module M is called ... |

31 | Pathway Logic: executable models of biological networks
- Eker, Knapp, et al.
(Show Context)
Citation Context ...de 2.0. 6 Concluding Remarks The advances in Maude 2.0 have been used to good advantage in several recent applications. The Pathway Logic project uses Maude to develop and analyze biological networks =-=[12,13]-=-. Search and model-checking are used to explore possible execution paths, and the new descent functions are used to analyze and visualize model-checking results. The ascent functions are used to trans... |

29 |
The Maude System
- Clavel, FJ, et al.
- 1999
(Show Context)
Citation Context ...radigm, as demonstrated by the mature implementations of the ELAN [1], CafeOBJ [15], and Maude [6] languages. We will focus in this paper on the main new features in Maude 2.0. We refer the reader to =-=[4,5]-=- for details on previous releases. Given space limitations, not even all these new features can be discussed here. The Maude system, its documentation, and related papers and applications are availabl... |

28 |
Term Rewriting with Operator Evaluation Strategy
- Eker
- 1998
(Show Context)
Citation Context ...the equational sublanguage of functional modules.s78 Manuel Clavel et al. Unfrozen arguments (those not frozen) are for rewrite theories the analog of the arguments specified in evaluation strategies =-=[10]-=- used for equational theories in OBJ, CafeOBJ, and Maude to improve efficiency and/or to guarantee the termination of computations, replacing unrestricted equational rewriting by context-sensitive rew... |

27 | Equational Abstractions
- Meseguer, Palomino, et al.
- 2003
(Show Context)
Citation Context ... in progress by two of the authors and M. Palomino using the metalevel features and formal tools to define and implement abstractions that convert infinite state models into finite state abstractions =-=[21]-=-. Rewriting logic and its realization in Maude allow for very natural modeling of distributed systems. The next major development of Maude will be to provide an extension that supports executable mode... |

21 | Termination of Rewriting With Strategy Annotations
- Lucas
- 2001
(Show Context)
Citation Context ...or equational theories in OBJ, CafeOBJ, and Maude to improve efficiency and/or to guarantee the termination of computations, replacing unrestricted equational rewriting by context-sensitive rewriting =-=[19]-=-. Thus, in Maude 2.0 rewriting with both equations E and rules R can be made context-sensitive. The mathematical semantics of generalized rewrite theories, and thus of modules in Maude 2.0, has been r... |

21 | An Executable Specification of Asynchronous Pi-Calculus Semantics and May Testing in Maude 2.0
- Thati, Sen, et al.
- 2002
(Show Context)
Citation Context ...ualize model-checking results. The ascent functions are used to transform the Maude model into a Petri net model for further analysis of possible execution paths. Work on CCS [26] and the Pi-Calculus =-=[25]-=- provides additional examples of the usefulness of new features of Maude 2.0, especially frozen arguments, enriched rule conditions, search, and metaSearch. Search, model-checking, and rewrites in rul... |

20 | Implementing CCS in Maude 2
- Verdejo, Martí-Oliet
- 2002
(Show Context)
Citation Context ...e used to analyze and visualize model-checking results. The ascent functions are used to transform the Maude model into a Petri net model for further analysis of possible execution paths. Work on CCS =-=[26]-=- and the Pi-Calculus [25] provides additional examples of the usefulness of new features of Maude 2.0, especially frozen arguments, enriched rule conditions, search, and metaSearch. Search, model-chec... |

19 |
The Rewriting Logic
- Meseguer, Rosu
- 2007
(Show Context)
Citation Context ...other words, a reflective logic is a logic which can be faithfully represented in itself. Maude’s language design and implementation make systematic use of the fact that rewriting logic is reflective =-=[8]-=-. In Maude, key functionality of a metalevel theory with several metalevel functions has been efficiently implemented in its functional module META-LEVEL. Maude 2.0 includes improvements in the metare... |

9 |
Associative-Commutative Rewriting on Large Terms
- Eker
- 2003
(Show Context)
Citation Context ...e major ones.s84 Manuel Clavel et al. The Core Rewrite Engine. The most radical change from Maude 1.0 is the use of a novel term representation based on persistent data structures [9] for E-rewriting =-=[11]-=-. In some cases, new rewriting algorithms based on this representation can dramatically improve the rewriting speed for large terms. Table 1 compares the performance of Maude with and without this rep... |

5 |
Equational rules for rewriting logic, Theoretical Computer Science 285
- Viry
- 2002
(Show Context)
Citation Context .... Similarly, to be efficiently executable, a generalized rewrite theory R =(Σ,E,φ,R) should first of all have (Σ,E) satisfying the above executability requirements, and should furthermore be coherent =-=[27]-=-. Executability is of course what we want for programming; but it is too restrictive for specification, transformation, and reasoning purposes, even when programming is the ultimate goal. For this rea... |

1 |
To be presented at the DARPA
- Talcott
- 2003
(Show Context)
Citation Context ..., search, and metaSearch. Search, model-checking, and rewrites in rule conditions have been used in a project to model and analyze a proposed secure architecture for accessing remote services in Java =-=[24]-=-. Work is in progress by two of the authors and M. Palomino using the metalevel features and formal tools to define and implement abstractions that convert infinite state models into finite state abst... |