Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack [PDF]
Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, even libraries that the user does not want to debug and which may use language features not supported by the debugger. This is a pity, because a promising approach to debugging is therefore not applicable to many real-world programs.
Faddegon, Maarten, Chitil, Olaf
core +7 more sources
Combining algorithmic debugging and program slicing [PDF]
Currently, program slicing and algorithmic debugging are two of the most relevant debugging techniques for declarative languages. They help programmers to find bugs in a semiautomatic manner. On the one hand, program slicing is a technique to extract those program fragments that (potentially) affect the values computed at some point of interest. On the
Silva, Josep, Chitil, Olaf
semanticscholar +4 more sources
Algorithmic Debugging and Literate Programming to Generate Feedback in Intelligent Tutoring Systems [PDF]
Algorithmic debugging is an effective diagnosis method in intelligent tutoring systems (ITSs). Given an encoding of expert problem-solving as a logic program, it compares the program’s behaviour during incremental execution with observed learner behaviour. Any deviation captures a learner error in terms of a program location. The feedback engine of the
Claus Zinn
semanticscholar +4 more sources
Algorithmic Debugging of Java Programs
AbstractIn this paper we propose applying the ideas of declarative debugging to the object-oriented language Java as an alternative to traditional trace debuggers used in imperative languages. The declarative debugger builds a suitable computation tree containing information about method invocations occurred during a wrong computation. The tree is then
Caballero, R., Hermanns, C., Kuchen, H.
openaire +2 more sources
Proving the Correctness of Algorithmic Debugging for Functional Programs [PDF]
This paper formally presents a model of tracing for functional programs based on a small-step operational semantics. The model records the computation of a functional program in a graph which can be utilised for various purposes such as algorithmic debugging.
Luo, Yong, Chitil, Olaf
openaire +3 more sources
Towards an Intelligent Debugging System for Pascal Programs: On the Theory and Algorithms of Plan Recognition in Rich's Plan Calculus [PDF]
This thesis presents work in progress on building an intelligent general purpose, domain-free debugging system for Pascal programs. This system (IDS) is based on Rich’s surface plan/plan calculus graph formalisms, and this thesis develops theory and algorithms for performing program understanding within this framework.
Rüdi Lutz
openaire +2 more sources
Algorithmic Debugging with Cyclic Traces of Lazy Functional Programs [PDF]
We have proved the correctness of algorithmic debugging if the traces are acyclic. For cyclic traces, however, does algorithmic debugging still work? There does not exist a common understanding of how to debug cyclic traces in functional programming communities for a long time.
Luo, Yong, Chitil, Olaf
openaire +1 more source
Comprehending finite maps for algorithmic debugging of higher-order functional programs [PDF]
Algorithmic debuggers for higher-order functional languages have to display functional values. Originally functional values had been represented as partial applications of function and constructor symbols, but a recent approach represents functional values as finite maps.
Chitil, Olaf, Davie, Thomas
openaire +2 more sources
Error Debugging Problem in Python Programming Learning Assistant System using Error Debugging Method extension Blank Element Selection Algorithms [PDF]
Hsu Wai Hnin, Khin Khin Zaw
openaire +2 more sources
The effect of play and worked examples on first and third graders' creating and debugging of programming algorithms [PDF]
Laura Bofferding +4 more
openaire +2 more sources

