DROPS

Document

DOI: 10.4230/LIPIcs.RTA.2010.277

Declarative Debugging of Missing Answers for Maude

Authors: Adrian Riesco, Alberto Verdejo, and Narciso Marti-Oliet

Published in: LIPIcs, Volume 6, Proceedings of the 21st International Conference on Rewriting Techniques and Applications (2010)

Abstract

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 error. Membership equational logic (MEL) is an equational logic that in addition to equations allows the statement of membership axioms characterizing the elements of a sort. Rewriting logic is a logic of change that extends MEL by adding rewrite rules, that correspond to transitions between states and can be nondeterministic. In this paper we propose a calculus that allows to infer normal forms and least sorts with the equational part, and sets of reachable terms through rules. We use an abbreviation of the proof trees computed with this calculus to build appropriate debugging trees for missing answers (results that are erroneous because they are incomplete), whose adequacy for debugging is proved. Using these trees we have implemented a declarative debugger for Maude, a high-performance system based on rewriting logic, whose use is illustrated with an example.

Cite as

Adrian Riesco, Alberto Verdejo, and Narciso Marti-Oliet. Declarative Debugging of Missing Answers for Maude. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 277-294, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{riesco_et_al:LIPIcs.RTA.2010.277,
  author =	{Riesco, Adrian and Verdejo, Alberto and Marti-Oliet, Narciso},
  title =	{{Declarative Debugging of Missing Answers for Maude}},
  booktitle =	{Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
  pages =	{277--294},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-18-7},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{6},
  editor =	{Lynch, Christopher},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.277},
  URN =		{urn:nbn:de:0030-drops-26589},
  doi =		{10.4230/LIPIcs.RTA.2010.277},
  annote =	{Keywords: Declarative debugging, Maude, Missing answers, Rewriting}
}

Search Results

Documents authored by Riesco, Adrian

Declarative Debugging of Missing Answers for Maude

Abstract

Cite as

Thanks for your feedback!

Could not send message