Pages that link to "Item:Q1608925"
From MaRDI portal
The following pages link to Equational rules for rewriting logic (Q1608925):
Displayed 40 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- A formal library of set relations and its application to synchronous languages (Q654904) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- Language definitions as rewrite theories (Q730476) (← links)
- Algebraic simulations (Q844884) (← links)
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude (Q862853) (← links)
- The rewriting logic semantics project (Q877024) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Equational abstractions (Q944377) (← links)
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude (Q1004068) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Declarative debugging of rewriting logic specifications (Q1931907) (← links)
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude (Q1951606) (← links)
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems (Q2095424) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Normalising Lustre preserves security (Q2119981) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
- Partial Order Reduction for Rewriting Semantics of Programming Languages (Q2873775) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- The Formal System of Dijkstra and Scholten (Q2945729) (← links)
- The Rewriting Logic Semantics Project: A Progress Report (Q3088267) (← links)
- Simulation and Verification of Synchronous Set Relations in Rewriting Logic (Q3098052) (← links)
- Declarative Debugging of Rewriting Logic Specifications (Q3184739) (← links)
- Effectively Checking the Finite Variant Property (Q3522010) (← links)
- Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
- A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting (Q5166636) (← links)
- Variant Narrowing and Equational Unification (Q5179131) (← links)
- Mechanical Analysis of Reliable Communication in the Alternating Bit Protocol Using the Maude Invariant Analyzer Tool (Q5403085) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
- Optimizing Maude programs via program specialization (Q6175104) (← links)