Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Silva, J. (2007). A comparative study of algorithmic debugging strategies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4407 LNCS, pp. 143–159). Springer Verlag. https://doi.org/10.1007/978-3-540-71410-1_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
