Benoy, Florence and King, Andy
Inferring Argument Size Relationships with CLP(R).
Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation.
Lecture Notes in Computer Science, 1207.
ISBN 3-540-62718-9 .
(Full text available)
Argument size relationships are useful in termination analysis which, in turn, is important in program synthesis and goal-replacement transformations. We show how a precise analysis for inter-argument size relationships, formulated in terms of abstract interpretation, can be implemented straightforwardly in a language with constraint support like CLP(R) or SICStus version 3. The analysis is based on polyhedral approximations and uses a simple relaxation technique to calculate least upper bounds and a delay method to improve the precision of widening. To the best of our knowledge, and despite its simplicity, the analysis derives relationships to an accuracy that is either comparable or better than any existing technique.
- Depositors only (login required):