Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
The rewriting logic semantics project
Theoretical Computer Science
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
A rewriting logic approach to operational semantics
Information and Computation
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
Foundations of Security Analysis and Design V
Recent Trends in Algebraic Development Techniques
Declarative Debugging of Rewriting Logic Specifications
Recent Trends in Algebraic Development Techniques
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Towards an executable algebra for product lines
Proceedings of the 16th International Software Product Line Conference - Volume 2
| Hi-index | 0.00 |
Maude [7] is a high-level language and high-performance system supporting both equational and rewriting logic computation for a wide range of applications. It is a declarative language because Maude modules correspond in general to specifications in rewriting logic [20], a simple and expressive logic which allows the representation of many models of concurrent and distributed systems. This logic is an extension of equational logic; in particular, Maude functional modules correspond to specifications in membership equational logic (MEL) [1,21], which, in addition to equations, allows the statement of membership assertions characterizing the elements of a sort. In this way, Maude makes possible the faithful specification of data types (like sorted lists or search trees) whose data are defined not only by means of constructors, but also by the satisfaction of additional properties.