Pages that link to "Item:Q1615001"

The following pages link to Rewriting logic: Roadmap and bibliography (Q1615001):

Displaying 28 items.

• Exploring conditional rewriting logic computations (Q485831) (← links)
• Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
• Algebraic simulations (Q844884) (← links)
• Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
• A new generic scheme for functional logic programming with constraints (Q880985) (← links)
• Termination of just/fair computations in term rewriting (Q924727) (← links)
• A rewriting logic approach to operational semantics (Q1012130) (← links)
• Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
• Manipulating algebraic specifications with term-based and graph-based representations (Q1885933) (← links)
• Twenty years of rewriting logic (Q1931904) (← links)
• A complete semantics of \(\mathbb{K}\) and its translation to Isabelle (Q2119971) (← links)
• Composing proof terms (Q2305425) (← links)
• Executable structural operational semantics in Maude (Q2369036) (← links)
• Semantic foundations for generalized rewrite theories (Q2503334) (← links)
• Abstraction and Model Checking of Core Erlang Programs in Maude (Q2873779) (← links)
• Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
• Heterogeneous Logical Environments for Distributed Specifications (Q3184737) (← links)
• Mechanical Approach to Linking Operational Semantics and Algebraic Semantics for Verilog Using Maude (Q3455649) (← links)
• A Declarative View of Signaling Pathways (Q3460870) (← links)
• The Existential Fragment of the One-Step Parallel Rewriting Theory (Q3636820) (← links)
• A Fully Abstract Semantics for Constructor Systems (Q3636832) (← links)
• Equational Abstractions for Reducing the State Space of Rewrite Theories (Q5179134) (← links)
• Backward Trace Slicing for Rewriting Logic Theories (Q5200013) (← links)
• Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way) (Q5403072) (← links)
• a-Logic With Arrows (Q5403474) (← links)
• Term Equational Systems and Logics (Q5415637) (← links)
• Memory Policy Analysis for Semantics Specifications in Maude (Q5743600) (← links)
• Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)