Riesco Rodríguez, Adrián and Verdejo López, José Alberto and Martí Oliet, Narciso and Caballero, Rafael (2010) Declarative debugging of rewriting logic speciﬁcations. [ Technical Report SIC; nº 10, 2, ] (Unpublished)

PDF
654kB 
Abstract
Declarative debugging is a semiautomatic 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 to state 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. We propose here a calculus to infer reductions, sort inferences, normal forms and least sorts with the equational part, and rewrites 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 both wrong (an incorrect result obtained from an initial result) and 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 highperformance system based on rewriting logic, whose use is illustrated with an example.
Item Type:  Working Paper or Technical Report 

Uncontrolled Keywords:  Declarative debugging, Rewriting logic, Maude, Wrong Answers, Missing answers 
Subjects:  Sciences > Computer science > Programming languages (Electronic computers) 
Series Name:  Technical Report SIC 
Volume:  2 
Number:  10 
ID Code:  11660 
Deposited On:  30 Nov 2010 09:01 
Last Modified:  06 Feb 2014 09:08 
Repository Staff Only: item control page