Implementation of an optimal strategy for algorithmic debugging

[EN] One of the most automatic debugging techniques is Algorithmic Debugging because it allows us to debug a program without the need to inspect the source code. In order to find a bug, an algorithmic debugger asks questions to the programmer about the correctness of subcomputations in an execution. Reducing the number and complexity of these questions is an old objective in this field. Recently, an strategy for algorithmic debuggers that minimizes the number of questions has been released. This new strategy is called Optimal Divide and Query and, provided that all questions can be answered, it finds any bug in the source code with a minimum set of questions. In this work we discuss the implementation of such a strategy in different algorithmic debugging architectures. © 2011 Elsevier B.V. All rights reserved.This work has been partially supported by the Spanish Ministerio de Ciencia e Innovación (Secretar´ıa de Estado de Investigaci´on) under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052Insa Cabrera, D.; Silva Galiana, JF. (2012). Implementation of an optimal strategy for algorithmic debugging. Electronic Notes in Theoretical Computer Science. 282:47-60. https://doi.org/10.1016/j.entcs.2011.12.005S476028

Enhancing declarative debugging with loop expansion and tree compression

This work has been partially supported by the Spanish Ministerio de Econom´ıa y Competitividad (Secretar´ıa de Estado de Investigaci´on, Desarrollo e Innovaci´on) under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052. David Insa was partially supported by the Spanish Ministerio de Eduaci´on under FPU grant AP2010-4415Insa Cabrera, D.; Silva Galiana, JF.; Tomás Franco, C. (2013). Enhancing declarative debugging with loop expansion and tree compression. En Logic-Based Program Synthesis and Transformation. Springer Verlag (Germany). 71-88. https://doi.org/10.1007/978-3-642-38197-3_6S7188Binks, D.: Declarative Debugging in Gödel. PhD thesis, University of Bristol (1995)Calejo, M.: A Framework for Declarative Prolog Debugging. PhD thesis, New University of Lisbon (1992)Davie, T., Chitil, O.: Hat-delta: One Right Does Make a Wrong. In: Butterfield, A. (ed.) Draft Proceedings of the 17th International Workshop on Implementation and Application of Functional Languages, IFL 2005, p. 11. Tech. Report No: TCD-CS-2005-60, University of Dublin, Ireland (September 2005)Davie, T., Chitil, O.: Hat-delta: One Right Does Make a Wrong. In: Seventh Symposium on Trends in Functional Programming, TFP 2006 (April 2006)Harrison, P.G., Khoshnevisan, H.: A new approach to recursion removal. Theor. Comput. Sci. 93(1), 91–113 (1992)Hirunkitti, V., Hogger, C.J.: A Generalised Query Minimisation for Program Debugging. In: Adsul, B. (ed.) AADEBUG 1993. LNCS, vol. 749, pp. 153–170. Springer, Heidelberg (1993)Insa, D., Silva, J.: An Algorithmic Debugger for Java. In: Proc. of the 26th IEEE International Conference on Software Maintenance, pp. 1–6 (2010)Insa, D., Silva, J.: Debugging with Incomplete and Dynamically Generated Execution Trees. In: Proc. of the 20th International Symposium on Logic-based Program Synthesis and Transformation, LOPSTR 2010, Austria (2010)Insa, D., Silva, J.: A Transformation of Iterative Loops into Recursive Loops. Technical Report DSIC/05/12, Universidad Politécnica de Valencia (2012), http://www.dsic.upv.es/~jsilva/research.htm#techsInsa, D., Silva, J., Tomás, C.: Enhancing Declarative Debugging with Loop Expansion and Tree Compression. Technical Report DSIC/11/12, Universidad Politécnica de Valencia (2012), http://www.dsic.upv.es/~jsilva/research.htm#techsLiu, Y.A., Stoller, S.D.: From recursion to iteration: what are the optimizations? In: Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 2000, pp. 73–82. ACM, New York (2000)Lloyd, J.W.: Declarative error diagnosis. New Gen. Comput. 5(2), 133–154 (1987)Nilsson, H.: Declarative Debugging for Lazy Functional Languages. PhD thesis, Linköping, Sweden (May 1998)NIST: The Economic Impacts of Inadequate Infrastructure for Software Testing. USA National Institute of Standards and Technology, NIST Planning Report 02-3 (May 2002)Riesco, A., Verdejo, A., Martí-Oliet, N., Caballero, R.: Declarative Debugging of Rewriting Logic Specifications. Journal of Logic and Algebraic Programming (September 2011)Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press (1982)Silva, J.: A Survey on Algorithmic Debugging Strategies. Advances in Engineering Software 42(11), 976–991 (2011)Yi, Q., Adve, V., Kennedy, K.: Transforming loops to recursion for multi-level memory hierarchies. In: Proceedings of the SIGPLAN 2000 Conference on Programming Language Design and Implementation, pp. 169–181 (2000