The following pages link to ChC 3 (Q21760):
Displaying 10 items.
- Exploring conditional rewriting logic computations (Q485831) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Backward Trace Slicing for Conditional Rewrite Theories (Q2891440) (← links)
- Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis (Q2945700) (← links)
- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis (Q4928441) (← links)
- A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications (Q4933279) (← links)
- A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories (Q4933280) (← links)
- Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6 (Q5389069) (← links)
- Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way) (Q5403072) (← links)
