Two Decades of Maude

Clavel, Manuel; Durán, Francisco; Eker, Steven; Escobar, Santiago; Lincoln, Patrick; Martí-Oliet, Narciso; Talcott, Carolyn

doi:10.1007/978-3-319-23165-5_11

Cited by 4 publications

(5 citation statements)

References 66 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…( 4) Not only time, but also randomness in distributed object systems can be modeled by probabilistic rewrite rules [1] (see, e.g., [76,14] for two applications, respectively to sensor protocols and to cloud storage systems). Maude has been used for the specification and verification of many other distributed systems; see, e.g., [28,98,26] for surveys on additional applications.…”

Section: Maudementioning

confidence: 99%

Programming and symbolic computation in Maude

Durán

Eker

Escobar

et al. 2020

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories. Maude has also a formal environment of verification tools. Symbolic computation is a powerful technique for reasoning about the correctness of concurrent systems and for increasing the power of formal tools. We present several new symbolic features of Maude that enhance formal reasoning about Maude programs and the effectiveness of formal tools. They include: (i) very general unification modulo user-definable equational theories, and (ii) symbolic reachability analysis of concurrent systems using narrowing. The paper does not focus just on symbolic features: it also describes several other new Maude features, including: (iii) Maude's strategy language for controlling rewriting, and (iv) external objects that allow flexible interaction of Maude object-based concurrent systems with the external world. In particular, metainterpreters are external objects encapsulating Maude interpreters that can interact with many other objects. To make the paper self-contained and give a reasonably complete language overview, we also review the basic Maude features for equational rewriting and rewriting with rules, Maude programming of concurrent object systems, and reflection. Furthermore, we include many examples illustrating all the Maude notions and features described in the paper.

show abstract

Section: Maudementioning

confidence: 99%

Programming and symbolic computation in Maude

Durán

Eker

Escobar

et al. 2020

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Maude is a simple and expressive language which has a high-performance implementation. Maude offers two programming levels (Clavel et al, 2015): Core Maude integrates functional, system modules and Full Maude which integrates object oriented modules.…”

Section: Rewriting Logic and Maudementioning

confidence: 99%

“…In functional modules (Clavel et al, 2015), data types and operations are defined using signatures and equations. Rewrite laws are introduced in system modules.…”

Section: Rewriting Logic and Maudementioning

confidence: 99%

“…These rules take the form: "R: [t] → [t'] if C", that means: term t rewrites to t' if a condition C is satisfied, C is optional. Finally, object oriented modules allow modeling object configurations and messages in more appropriate notations (Clavel et al, 2015).…”

Section: Rewriting Logic and Maudementioning

confidence: 99%

“…Formal methods offer high level of rigorous and analyzable descriptions allowing simulation and verification process. Maude is the powerful rewriting logic formal specification for concurrent systems (Clavel et al, 2015). It offers many possibilities of verification and validation through its own LTL model checker (Eker et al, 2003).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Formal Modeling and Analysis of Object Oriented Systems using Triple Graph Grammars

Chama

Chaoui

Rehab

2015

International Journal of Embedded and Real-Time Communication Systems

View full text Add to dashboard Cite

This paper proposes a Model Driven Engineering automatic translation approach based on the integration of rewriting logic formal specification and UML semi-formal models. This integration is a contribution in formalizing UML models since it lacks for formal semantics. It aims at providing UML with the capabilities of rewriting logic and its Maude language to control and detect incoherencies in their diagrams. Rewriting logic Maude language allows simulation and verification of system's properties using its LTL model-checker. This automatic translation approach is based on meta-modeling and graph transformation since UML diagrams are graphs. More precisely, the authors have proposed five meta-models and three triple graph grammars to perform the translation process. The authors have used Eclipse Generative Modeling tools: Eclipse Modeling Framework (EMF) for meta-modeling, Graphical Modeling Framework (GMF) for generating visual modeling tools and TGG Interpreter for proposing triple graph grammars. The approach is illustrated through an example.

show abstract

The Hrewrite Library: A Term Rewriting Engine for Automatic Code Assembly

Lienhardt

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Two Decades of Maude

Cited by 4 publications

References 66 publications

Programming and symbolic computation in Maude

Programming and symbolic computation in Maude

Formal Modeling and Analysis of Object Oriented Systems using Triple Graph Grammars

The Hrewrite Library: A Term Rewriting Engine for Automatic Code Assembly

Contact Info

Product

Resources

About