Inspecting rewriting logic computations (in a parametric and stepwise way)
From MaRDI portal
(Redirected from Publication:5403072)
Recommendations
Cites work
- scientific article; zbMATH DE number 1692948 (Why is no real title available?)
- scientific article; zbMATH DE number 2043518 (Why is no real title available?)
- scientific article; zbMATH DE number 2043522 (Why is no real title available?)
- A Maude coherence checker tool for conditional order-sorted rewrite theories
- Backward trace slicing for conditional rewrite theories
- Backward trace slicing for rewriting logic theories
- Conditional rewriting logic as a unified model of concurrency
- Declarative Debugging of Rewriting Logic Specifications
- Declarative debugging of missing answers for Maude
- Rewriting logic: Roadmap and bibliography
- Semantic foundations for generalized rewrite theories
- The Temporal Logic of Rewriting: A Gentle Introduction
- The origins of structural operational semantics
Cited in
(8)- Debugging Maude programs via runtime assertion checking and trace slicing
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis
- Exploring conditional rewriting logic computations
- Backward trace slicing for rewriting logic theories
- Combining runtime checking and slicing to improve Maude error diagnosis
- A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules
- Backward trace slicing for conditional rewrite theories
This page was built for publication: Inspecting rewriting logic computations (in a parametric and stepwise way)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403072)