Advertisement

A Slicing Tool for Lazy Functional Logic Programs

  • Claudio Ochoa
  • Josep Silva
  • Germán Vidal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4160)

Abstract

Program slicing is a well-known technique that has been widely used for debugging in the context of imperative programming. Debugging is a particularly difficult task within lazy declarative programming. In particular, there exist very few approaches to program slicing in this context. In this paper, we describe a slicing tool for first-order lazy functional logic languages. We also illustrate its usefulness by means of an example.

Keywords

Original Program Source Program Program Fragment Imperative Programming Program Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Braßel, B., Hanus, M., Huch, F., Vidal, G.: A Semantics for Tracing Declarative Multi-Paradigm Programs. In: Proc. of PPDP 2004, pp. 179–190. ACM Press, New York (2004)CrossRefGoogle Scholar
  2. 2.
    Ochoa, C., Silva, J., Vidal, G.: Dynamic Slicing Based on Redex Trails. In: Proc. of PEPM 2004, pp. 123–134. ACM Press, New York (2004)CrossRefGoogle Scholar
  3. 3.
    Weiser, M.D.: Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method. PhD thesis, U. of Michigan (1979)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Claudio Ochoa
    • 1
  • Josep Silva
    • 2
  • Germán Vidal
    • 2
  1. 1.DIATech. University of MadridBoadilla del MonteSpain
  2. 2.Technical University of ValenciaValenciaSpain

Personalised recommendations