Equational rules for rewriting logic
From MaRDI portal
Publication:1608925
DOI10.1016/S0304-3975(01)00366-8zbMath1001.68058OpenAlexW2047406870MaRDI QIDQ1608925
Publication date: 13 August 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00366-8
Related Items (40)
Normalising Lustre preserves security ⋮ Rewriting logic: Roadmap and bibliography ⋮ Algebraic simulations ⋮ Declarative Debugging of Rewriting Logic Specifications ⋮ Specification and analysis of the AER/NCA active network protocol suite in real-time Maude ⋮ Rewriting modulo SMT and open system analysis ⋮ The rewriting logic semantics project ⋮ Semantics and pragmatics of real-time maude ⋮ Optimization of rewrite theories by equational partial evaluation ⋮ The Formal System of Dijkstra and Scholten ⋮ The rewriting logic semantics project: a progress report ⋮ Twenty years of rewriting logic ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Declarative debugging of rewriting logic specifications ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ Optimizing Maude programs via program specialization ⋮ Effectively Checking the Finite Variant Property ⋮ Verifying hierarchical Ptolemy II discrete-event models using real-time maude ⋮ A formal library of set relations and its application to synchronous languages ⋮ Theorem proving modulo ⋮ Equational abstractions ⋮ Mechanical Analysis of Reliable Communication in the Alternating Bit Protocol Using the Maude Invariant Analyzer Tool ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting ⋮ Variant Narrowing and Equational Unification ⋮ Proving operational termination of membership equational programs ⋮ Formalization and correctness of the PALS architectural pattern for distributed real-time systems ⋮ Language definitions as rewrite theories ⋮ Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ A rewriting logic approach to operational semantics ⋮ The Rewriting Logic Semantics Project: A Progress Report ⋮ Simulation and Verification of Synchronous Set Relations in Rewriting Logic ⋮ Termination Modulo Combinations of Equational Theories ⋮ A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs ⋮ Partial Order Reduction for Rewriting Semantics of Programming Languages ⋮ Narrowing and Rewriting Logic: from Foundations to Applications ⋮ Symbolic computation in Maude: some tapas
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional rewrite rules: Confluence and termination
- Conditional rewriting logic as a unified model of concurrency
- AC-unification race: The system solving approach, implementation and benchmarks
- Rewriting logic and its applications. Proceedings of the 1st international workshop, Pacific Grove, CA, USA, September 3--6, 1996
- Theorem proving modulo
- Higher order unification via explicit substitutions
- Functional back-ends within the lambda-sigma calculus
- λν, a calculus of explicit substitutions which preserves strong normalisation
- Completion of a Set of Rules Modulo a Set of Equations
- Complete Sets of Reductions for Some Equational Theories
- Communicating sequential processes
- Extension orderings
- Term Rewriting and All That
This page was built for publication: Equational rules for rewriting logic
