Generalized rewrite theories

DOI10.1007/3-540-45061-0_22MaRDI QIDQ4449180zbMATH OpenFDO

Authors Roberto Bruni, José Meseguer

Publication date 8 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190252.htm

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Semantic foundations for generalized rewrite theories
• Rewriting logic and Maude: Concepts and applications
• Maude: specification and programming in rewriting logic
• Conditional rewriting logic: Deduction, models and concurrency
• The Maude 2.0 system

Cited in

(26)

• Operational termination of conditional term rewriting systems
• Observational congruences for dynamically reconfigurable tile systems
• Twenty years of rewriting logic
• Applications and extensions of context-sensitive rewriting
• Proving operational termination of membership equational programs
• Generalized rewrite theories, coherence completion, and symbolic methods
• Executable structural operational semantics in Maude
• Semantic foundations for generalized rewrite theories
• Optimization of rewrite theories by equational partial evaluation
• Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
• Recent advances in real-time Maude
• Abstraction and completeness for real-time Maude
• scientific article; zbMATH DE number 4126684 (Why is no real title available?)
• Term rewriting in a logic of special relations
• scientific article; zbMATH DE number 2090711 (Why is no real title available?)
• scientific article; zbMATH DE number 827981 (Why is no real title available?)
• The third rewrite engines competition
• Term Rewriting and Applications
• Modular rewritable Petri nets: an efficient model for dynamic distributed systems
• Generalized rewrite theories and coherence completion
• Canonization of reconfigurable PT nets in \texttt{Maude}
• Proving termination of context-sensitive rewriting by transformation
• Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
• The rewriting logic semantics project
• Rewriting with equivalence relations in ACL2
• Equational abstractions

Describes a project that uses

Uses Software

• Maude
• CafeOBJ

This page was built for publication: Generalized rewrite theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449180)