Sciweavers

Share
6 search results - page 1 / 2
» Dynamic slicing of lazy functional programs based on redex t...
Sort
View
LISP
2008
96views more  LISP 2008»
11 years 12 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 trac...
Claudio Ochoa, Josep Silva, Germán Vidal
PEPM
2004
ACM
12 years 5 months ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
12 years 5 months ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
PPDP
2004
Springer
12 years 5 months ago
A semantics for tracing declarative multi-paradigm programs
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a diļ¬ƒcult task due...
Bernd Brassel, Michael Hanus, Frank Huch, Germ&aac...
WCFLP
2005
ACM
12 years 5 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
books