A comparative study of algorithmic debugging strategies

  • Authors:
  • Josep Silva

  • Affiliations:
  • DSIC, Technical University of Valencia, Valencia, Spain

  • Venue:
  • LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.