Algorithmic debugging is a technique proposed in 1982 by EY Shapiro in the context of logic
programming. This survey shows how the initial ideas have been developed to become a …

In many fields of software engineering, studies on human behavior have attracted a lot of
attention; however, few such studies exist in automated debugging. Parnin and Orso …

Algorithmic debugging is a debugging technique that has been extended to practically all
programming paradigms. Roughly speaking, the technique constructs an internal …

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 …

Program slicing provides explanations that illustrate how program outputs were produced
from inputs. We build on an approach introduced in prior work, where dynamic slicing was …

This paper presents how to build a type debugger without implementing any dedicated type
inferencer. Previous type debuggers required their own type inferencers apart from the …

This thesis is concerned with the investigation and implementation of a number of
refactorings for Haskell. The refactorings are themselves written in Haskell [108], and …

A formal executable semantics of a programming language has the necessary information to
develop program debugging and reasoning techniques. In this paper we choose such a …

The tracer Hat records in a detailed trace the computation of a program written in the lazy
functional language Haskell. The trace can then be viewed in various ways to support …

Compilers for languages with type inference algorithms often produce confusing type error
messages and give a single error location which is sometimes far away from the real …