Declarative Debugging of Rewriting Logic Specifications

Declarative debugging is a semi-automatic technique that starts from all 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 debugging trees obtained as the result of collapsing in proof trees all those nodes whose correctness does riot need any justification. Since these trees are obtained from a suitable semantic calculus, the correctness and completeness of the debugging technique call be formally proved. We illustrate how to use the debugger by means of an example and succinctly describe its implementation in Maude itself thanks to its reflective and metalanguage features.