Algorithmic Program DeBugging
A Declarative Debugger for Maude
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A Declarative Debugger for Maude Functional Modules
Electronic Notes in Theoretical Computer Science (ENTCS)
Declarative Debugging of Rewriting Logic Specifications
Recent Trends in Algebraic Development Techniques
A comparative study of algorithmic debugging strategies
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Enhancing the debugging of Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Evaluating and debugging OCL expressions in UML models
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Program analysis scenarios in rascal
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Using conditional trace slicing for improving Maude programs
Science of Computer Programming
| Hi-index | 0.00 |
We present a declarative debugger for Maude specifications that allows to debug wrong answers (a wrong result is obtained) and missing answers (a correct but incomplete result is obtained) due to both wrong and missing statements and wrong search conditions. The debugger builds a tree representing the computation and guides the user through it to find the bug. We present the debugger's latest commands and features, illustrating its use with several examples.