School of Computing

Inferring Argument Size Relationships with CLP(R)

Florence Benoy and Andy King

In Logic Program Synthesis and Transformation, volume 1207 of Lecture Notes in Computer Science, pages 182-196. Springer-Verlag, August 1997.

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.

Download publication 241 kbytes (PostScript)

Bibtex Record

@inproceedings{510,
author = {Florence Benoy and Andy King},
title = {{Inferring Argument Size Relationships with CLP(R)}},
month = {August},
year = {1997},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1997/510},
    booktitle = {Logic Program Synthesis and Transformation},
    publisher = {Springer-Verlag},
    refereed = {yes},
    volume = {1207},
    series = {Lecture Notes in Computer Science},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014