Declarative Debugging of Rewriting Logic Specifications

@inproceedings{Riesco2008DeclarativeDO,
  title={Declarative Debugging of Rewriting Logic Specifications},
  author={Adri{\'a}n Riesco and Alberto Verdejo and Rafael Caballero and Narciso Mart{\'i}-Oliet},
  booktitle={WADT},
  year={2008}
}
Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree representing this computation and guiding the user through it to find the wrong statement. This paper presents the fundamentals for the declarative debugging of rewriting logic specifications, realized in the Maude language, where a wrong computation can be a reduction, a type inference, or a rewrite. We define appropriate… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 32 CITATIONS

Specification, Algebra, and Software

  • Lecture Notes in Computer Science
  • 2014
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Logic-Based Program Synthesis and Transformation

  • Lecture Notes in Computer Science
  • 2011
VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Tests and Proofs

  • Lecture Notes in Computer Science
  • 2013
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Using Narrowing to Test Maude Specifications

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

Optimization Techniques for Algorithmic Debugging

  • Bulletin of the EATCS
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

A comparative study of algorithmic debugging strategies

J. Silva
  • G. Puebla, editor, Logic-Based Program Synthesis and Transformation, volume 4407 of Lecture Notes in Computer Science, pages 143–159. Springer
  • 2007
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

N

M. Clavel, F. Durán, S. Eker, P. Lincoln
  • Mart́ı-Oliet, J. Meseguer, and C. Talcott. All About Maude: A High-Performance Logical Framework, volume 4350 of Lecture Notes in Computer Science. Springer
  • 2007
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Structure and Properties of Traces for Functional Programs

  • Electr. Notes Theor. Comput. Sci.
  • 2007
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Münster Curry User’s Guide

W. Lux
  • 0.9.10 edition
  • 2006
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Semantic foundations for generalized rewrite theories

  • Theor. Comput. Sci.
  • 2006
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL