Sciweavers

Share
LISP
2008

Dynamic slicing of lazy functional programs based on redex trails

11 years 10 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trace of a computation is generally useless. Typically, tracers for lazy languages rely on the construction of a redex trail, a graph that stores the reductions performed in a computation. While tracing provides a significant help for locating bugs, the task still remains complex. A well-known debugging technique for imperative programs is based on dynamic slicing, a method for finding the program statements that influence the computation of a value for a specific program input. In this work, we introduce a novel technique for dynamic slicing in first-order lazy functional languages. Rather than starting from scratch, our technique relies on (a slight extension of) redex trails. We provide a notion of dynamic slice and introduce a method to compute it from the redex trail of a computation. We also sketch the exte...
Claudio Ochoa, Josep Silva, Germán Vidal
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where LISP
Authors Claudio Ochoa, Josep Silva, Germán Vidal
Comments (0)
books