Declarative Debugging of Rewriting Logic Specifications
From MaRDI portal
Publication:3184739
DOI10.1007/978-3-642-03429-9_20zbMath1253.68097OpenAlexW1940221711WikidataQ123905861 ScholiaQ123905861MaRDI QIDQ3184739
Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet, Rafael Caballero
Publication date: 22 October 2009
Published in: Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03429-9_20
Related Items
Twenty years of rewriting logic ⋮ Declarative debugging of rewriting logic specifications ⋮ Exploring conditional rewriting logic computations ⋮ Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way) ⋮ A Complete Declarative Debugger for Maude
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Declarative error diagnosis
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Conditional rewriting logic as a unified model of concurrency
- Equational rules for rewriting logic
- Specification and proof in membership equational logic
- Semantic foundations for generalized rewrite theories
- Structure and Properties of Traces for Functional Programs
- How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger
- Declarative Debugging of Membership Equational Logic Specifications
- A Declarative Debugger for Maude Functional Modules
- Functional and Logic Programming
- Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
