Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Program Specialization Based on Dynamic Slicing Claudio Ochoa1
 

Summary: Program Specialization Based on Dynamic Slicing
Claudio Ochoa1
, Josep Silva1
, and Germ´an Vidal1
DSIC, Tech. University of Valencia, Camino de Vera s/n, E-46022 Valencia, Spain.
{cochoa,jsilva,gvidal}@dsic.upv.es
Abstract. Within the imperative programming paradigm, program slicing has been widely used
as a basis to solve many software engineering problems, like program understanding, debugging,
testing, differencing, specialization, and merging. In this work, we present a lightweight approach
to program slicing in lazy functional logic languages and discuss its potential applications in the
context of pervasive systems where resources are limited. In particular, we show how program
slicing can be used to achieve a form of program specialization that cannot be achieved with
other, related techniques like partial evaluation.
1 Introduction
Essentially, program slicing is a method for decomposing programs by analyzing their data and control
flow. It was first proposed as a debugging tool to allow a better understanding of the portion of
code which revealed an error. Since this concept was originally introduced by Weiser [36, 37]--in
the context of imperative programs--it has been successfully applied to a wide variety of software
engineering tasks (e.g., program understanding, debugging, testing, differencing, specialization, and
merging). Surprisingly, there are very few approaches to program slicing in the context of declarative

  

Source: Alpuente, María - Departamento de Sistemas Informáticos y Computación, Universitat Politècnica de València
Vidal, Germán - Departamento de Sistemas Informáticos y Computación, Universitat Politècnica de València

 

Collections: Computer Technologies and Information Sciences