Publications of Maurizio Proietti

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Proietti M., in the category IASI Research Reports (or show them all):


IASI Research Report n. 304  (Previous    Next)


Alberto Pettorossi, Maurizio Proietti

The loop absorption and the generalization strategies for the development of logic programs.

ABSTRACT
The program transformation methodology for deriving correct and efficient programs is based on the application of correctness preserving rules and the invention of the so-called eureka definitions, which are necessary for improving program performances. We study the problem of generating those definitions in an automatic way in the case of definite logic programs. That problem, called the Foldability Problem, is formalized as the search for suitable trees of clauses, called foldable U-trees, which are derived by unfolding the initial programs. We present the Loop Absorption strategy which produces the required eureka definitions from foldable U-trees. We also show that the Foldability Problem is unsolvable, even for classes of very simple programs. However, it is possible to generate foldable U-trees in all cases if we allow ourselves the use of an extra transformation rule, called Generalization rule, together with the standard unfolding/folding rules. The Generalization rule should be applied with parsimony, because it may waste some opportunities for program improvement. Thus, we introduce the so-called Generalization strategy for allowing a clever use of that rule. We finally show that the Generalization strategy, together with the Loop Absorption strategy, is very useful also when computing residual programs by partial evaluation.
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -