Algorithmic debugging generalized

[EN] Algorithmic debugging is a semi-automatic debugging technique that abstracts the operational details of computations, allowing the programmers to debug their code from an abstract point of view. However, its use in practice is still marginal, and one of the reasons is the lack of precision of this technique when reporting errors (current algorithmic debuggers do not point an expression or line as buggy, but they point a whole procedure/function/method as containing the bug). In this paper, we make a step forward to overcome this problem. We identify two specific causes of that problem in the standard formulation and implementations of algorithmic debugging, and we present a reformulation to solve both problems. We show that the novel ideas included in the reformulation proposed cannot be supported by the standard internal data structures (such as the Execution Tree) used in this technique and, hence, a generalisation of the standard definitions and algorithms is needed. The reformulation has been done in a language independent manner to make it useful and reusable in different programming languages. (C) 2018 Elsevier Inc. All rights reserved.This work has been partially supported by the EU (FEDER) and the Spanish Ministerio de Economia y Competitividad under grants TIN2013-44742-C4-1-R and TIN2016-76843-C4-1-12, and by the Generalitat Valenciana under grant PROMETEO-II/2015/013 (SmartLogic).Insa Cabrera, D.; Silva, J. (2018). Algorithmic debugging generalized. Journal of Logical and Algebraic Methods in Programming. 97:85-104. https://doi.org/10.1016/j.jlamp.2018.02.003851049