School of Computing

Inferring numeric relationships for logic program transformation

Jon Martin and Andy King

In Pre-conference proceedings of Logic Program Synthesis and Transformation, pages 182-196, July 1997.

Abstract

Numeric relationships between program variables can be inferred with affine, interval or polyhedral abstractions but few, if any, analyses have addressed the problem of charactering the relationships that occur in and between recursive data structures. Such relationships are important, for example, in program transformation. This paper contributes an analysis which is precise enough to capture numeric relationships that occur deep within Herbrand terms. The analysis abstracts sets of numerical values by symbolic intervals and derives relationships among these intervals using linear inequality and minima constraints.

Download publication 107 kbytes (PostScript)

Bibtex Record

@inproceedings{512,
author = {Jon Martin and Andy King},
title = {Inferring Numeric Relationships for Logic Program Transformation},
month = {July},
year = {1997},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1997/512},
    booktitle = {Pre-conference proceedings of Logic Program Synthesis and Transformation},
    refereed = {yes},
}

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

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

Last Updated: 21/03/2014