Maude: specification and programming in rewriting logic

DOI10.1016/S0304-3975(01)00359-0zbMath1001.68059WikidataQ123905910 ScholiaQ123905910MaRDI QIDQ1608917

Francisco Durán, Narciso Martí-Oliet, Manuel Clavel, Steven Eker, Patrick D. Lincoln

Publication date: 13 August 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

reflection; parameterization; rewriting logic; Maude; internal strategies; functional modules; system modules

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68Q42: Grammars and rewriting systems

Related Items

Maude, Behavioral abstraction is hiding information, Two case studies of semantics execution in Maude: CCS and LOTOS, Creol: A type-safe object-oriented model for distributed concurrent systems, Proving termination of context-sensitive rewriting by transformation, A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties, Specification and analysis of the AER/NCA active network protocol suite in real-time Maude, Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic, A rewriting logic framework for operational semantics of membrane systems, The rewriting logic semantics project, Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols, Semantics and pragmatics of real-time maude, Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types, Reflection in conditional rewriting logic, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Rewriting logic: Roadmap and bibliography, Normal forms for algebras of connections., Structured theories and institutions, Executable structural operational semantics in Maude, Semantic foundations for generalized rewrite theories, Modular and incremental proofs of AC-termination

Uses Software

• ELAN
• OBJ3
• CafeOBJ

Cites Work

• Two case studies of semantics execution in Maude: CCS and LOTOS
• Combining matching algorithms: The regular case
• Conditional rewriting logic as a unified model of concurrency
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• PARLE 94, Parallel architectures and languages Europe, 6th International PARLE Conference, Athens, Greece, July 4-8, 1994. Proceedings
• Reflection in conditional rewriting logic
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Specification of real-time and hybrid systems in rewriting logic
• Actor theories in rewriting logic
• Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
• Specification and proof in membership equational logic
• Completion of a Set of Rules Modulo a Set of Equations
• Level-confluence of conditional rewrite systems with extra variables in right-hand sides
• Rewriting logic as a semantic framework for concurrency: a progress report
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item