Inferring Argument Size Relationships with CLP(R)

Benoy, Florence and King, Andy (1997) Inferring Argument Size Relationships with CLP(R). In: Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation. Lecture Notes in Computer Science, 1207. Springer-Verlag pp. 204-223. ISBN 3-540-62718-9 .

Postscript
Download (241Kb)	Preview
PDF
Download (171Kb)	Preview
Official URL http://www.cs.kent.ac.uk/pubs/1997/510

Abstract

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.

Item Type:	Conference or workshop item (Paper)
Uncontrolled keywords:	termination, logic programming, abstract interpretation
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	01 Aug 2009 13:57
Last Modified:	06 Sep 2011 03:54
Resource URI:	http://kar.kent.ac.uk/id/eprint/21464 (The current URI for this page, for reference purposes)

• Depositors only (login required):