Algorithmic debugging is a debugging technique that has been extended to practically all programming paradigms. It is based
on the answers of the programmer to a series of questions generated automatically by the algorithmic debugger. Therefore,
the performance of the technique is strongly dependent on the number and the complexity of these questions. In this work we
overview and compare current strategies for algorithmic debugging and we introduce some new strategies and discuss their advantages
over previous approaches.
This work has been partially supported by the EU (FEDER) and the Spanish MEC under grant TIN2005-09207-C03-02, by the ICT
for EU-India Cross-Cultural Dissemination Project ALA/95/23/2003/077-054, and by the Vicerrectorado de Innovación y Desarrollo
de la UPV under project TAMAT ref 5771.