Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Lightweight Approach to Program Specialization
 

Summary: A Lightweight Approach to
Program Specialization
Claudio Ochoa, Josep Silva, and Germ´an Vidal
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 slic-
ing has been widely used as a basis to solve many software engineering
problems, like debugging, testing, differencing, specialization, and merg-
ing. In this work, we present a lightweight approach to program spe-
cialization of lazy functional logic programs which is based on dynamic
slicing. The kind of specialization performed by our approach cannot be
achieved with other related techniques like partial evaluation.
1 Introduction
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 con-
cept was originally introduced by Weiser [24]--in the context of imperative pro-
grams--it has been successfully applied to a wide variety of software engineering
tasks (e.g., program understanding, debugging, testing, differencing, specializa-
tion, merging). Although it is not so popular in the declarative programming

  

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