| Home > Publications > Reports > Informatics (CW) |
CW 357
Nancy Mazur, Gerda Janssens, Wim Vanhoof
Collecting Potential Optimisations
Abstract
In this paper we describe an analysis system for logic programs that makes it possible to characterise the optimisation opportunities within a predicate. The idea behind the proposed framework is that for each predicate the literals that can potentially be optimised are identified and collected. The conditions under which these optimisations can be done safely are expressed as requirements on the calls to the predicate and collected into a so-called (local) optimisation table. This table does not only give a view on the potential of optimisation in a program, but as it relates the optimisations with call substitutions, it also defines the circumstances in which an optimisation can occur. This information can be valuable input during the development of better version generation heuristics, or can be given as feedback to the programmer.
report.pdf / mailto: G. Janssens