School of Computing

A Synergistic Analysis for Sharing and Groundness which traces Linearity

Andy King

In D.Sannella, editor, European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 363-378. Springer-Verlag, January 1994.

Abstract

Accurate variable sharing information is crucial both in the automatic parallelisation and in the optimisation of sequential logic programs. Analysis for possible variable sharing is thus an important topic in logic programming and many analyses have been proposed for inferring dependencies between the variables of a program, for instance, by combining domains and analyses. This paper develops the combined domain theme by explaining how term structure, and in particular linearity, can be represented in a sharing group format. This enables aliasing behaviour to be more precisely captured; groundness information to be more accurately propagated; and in addition, refines the tracking and application of linearity. In practical terms, this permits aliasing and groundness to be inferred to a higher degree of accuracy than in previous proposals and also can speed up the analysis itself. Correctness is formally proven.

Download publication 183 kbytes (PostScript)

Bibtex Record

@inproceedings{677,
author = {Andy King},
title = {{A} {S}ynergistic {A}nalysis for {S}haring and {G}roundness which traces {L}inearity},
month = {January},
year = {1994},
pages = {363-378},
keywords = {},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1994/677},
    booktitle = {European Symposium on Programming},
    publisher = {Springer-Verlag},
    refereed = {yes},
    series = {Lecture Notes in Computer Science},
    volume = {788},
    editor = {D.Sannella},
}

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

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

Last Updated: 12/03/2012 17:06