Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Generic Framework for the Analysis and Specialization of Logic Programs
 

Summary: A Generic Framework for the Analysis and
Specialization of Logic Programs
Germ´an Puebla1
, Elvira Albert2
, and Manuel Hermenegildo1,3
1
School of Computer Science, Technical U. of Madrid, {german,herme}@fi.upm.es
2
School of Computer Science, Complutense U. of Madrid, elvira@sip.ucm.es
3
Depts. of Comp. Sci. and El. and Comp. Eng., U. of New Mexico, herme@unm.edu
The relationship between abstract interpretation [2] and partial evaluation [5]
has received considerable attention and (partial) integrations have been proposed
starting from both the partial deduction (see e.g. [6] and its references) and ab-
stract interpretation perspectives. Abstract interpretation-based analyzers (such
as the CiaoPP analyzer [9, 4]) generally compute a program analysis graph [1] in
order to propagate (abstract) call and success information by performing fixpoint
computations when needed. On the other hand, partial deduction methods [7]
incorporate powerful techniques for on-line specialization including (concrete)
call propagation and unfolding.

  

Source: Arenas, Puri - Facultad de Informática, Universidad Politécnica de Madrid

 

Collections: Computer Technologies and Information Sciences