A Survey of Algorithmic Debugging-Reference-Cited by-同舟云学术

A Survey of Algorithmic Debugging

Published:2018-07-31 Issue:4 Volume:50 Page:1-35
ISSN:0360-0300
Container-title:ACM Computing Surveys
language:en
Short-container-title:ACM Comput. Surv.

Author:

Caballero Rafael¹^ORCID,Riesco Adrián¹,Silva Josep²

Affiliation:

1. Universidad Complutense de Madrid, Madrid, Spain

2. Universitat Politècnica de València, Camino de Vera, Valencia, Spain

Abstract

Algorithmic debugging is a technique proposed in 1982 by E. Y. Shapiro in the context of logic programming. This survey shows how the initial ideas have been developed to become a widespread debugging schema fitting many different programming paradigms and with applications out of the program debugging field. We describe the general framework and the main issues related to the implementations in different programming paradigms and discuss several proposed improvements and optimizations. We also review the main algorithmic debugger tools that have been implemented so far and compare their features. From this comparison, we elaborate a summary of desirable characteristics that should be considered when implementing future algorithmic debuggers.

Funder

Generalitat Valenciana

EU (FEDER) and the Spanish Ministerio de Economía y Competitividad

Comunidad de Madrid project N-Greens Software-CM

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3106740

Reference101 articles.

1. Relative debugging

2. K. R. Apt H. A. Blair and A. Walker. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming J. Minker (Ed.). Morgan Kaufmann Publishers Inc. San Francisco CA 89--148. 10.1016/B978-0-934613-40-8.50006-3 K. R. Apt H. A. Blair and A. Walker. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming J. Minker (Ed.). Morgan Kaufmann Publishers Inc. San Francisco CA 89--148. 10.1016/B978-0-934613-40-8.50006-3

3. Explaining program execution in deductive systems

4. B. Braßel and H. Siegel. 2008. Debugging Lazy Functional Programs by Asking the Oracle. Springer-Verlag Berlin 183--200. DOI:http://dx.doi.org/10.1007/978-3-540-85373-2_11 10.1007/978-3-540-85373-2_11 B. Braßel and H. Siegel. 2008. Debugging Lazy Functional Programs by Asking the Oracle. Springer-Verlag Berlin 183--200. DOI:http://dx.doi.org/10.1007/978-3-540-85373-2_11 10.1007/978-3-540-85373-2_11

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Explainable Program Synthesis by Localizing Specifications;Proceedings of the ACM on Programming Languages;2023-10-16

2. FxD: a functional debugger for dysfunctional spreadsheets;2023 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC);2023-10-03

3. On Feasibility of Declarative Diagnosis;Electronic Proceedings in Theoretical Computer Science;2023-09-12

4. Learning logic programs by explaining their failures;Machine Learning;2023-08-07

5. Automatic Rollback Suggestions for Incremental Datalog Evaluation;Practical Aspects of Declarative Languages;2023