Publications of Valerio Senni
|
|
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
2011, with author Senni V., in the category IASI Research Reports
(or show them all): IASI Research Report n. 11-24 (Previous ) Alberto Pettorossi, Maurizio Proietti, Senni V.Constraint-Based Correctness Proofs for Logic Program TransformationsABSTRACT Many approaches proposed in the literature for proving the
correctness of unfold/fold transformations of logic
programs make use of measures associated with program clauses.
When from a program P1 we derive a program P2 by a applying a
sequence of transformations, suitable conditions on the measures of
the clauses in P2 guarantee that the transformation of P1 into
P2 is correct, that is, P1 and P2 have the same least
Herbrand model. In the approaches proposed so far, clause measures
are fixed in advance, independently of the transformations to be
proved correct. In this paper we propose a method for the automatic
generation of clause measures which, instead, takes into account the
particular program transformation at hand. During the application of
a sequence of transformations we construct a system of linear
equalities and inequalities over nonnegative integers whose unknowns are the
clause measures to be found, and the correctness of the
transformation is guaranteed by the satisfiability of that system.
Through some examples we show that our method is more powerful and
practical than other methods proposed in the literature.
In particular, we are able to
establish in a fully automatic way the correctness of program
transformations which, by using other methods, are proved correct at
the expense of fixing in advance sophisticated clause measures. |
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
|