School of Computing

Analysis of Logic Programs with Delay

Andrew Heaton, Pat Hill, and Andy King

In N E Fuchs, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1463 of Lecture Notes in Computer Science, pages 182-196. Springer-Verlag, July 1998 Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.

Abstract

This paper focusses on practical analysis for logic programs with delay. The method described is for downward-closed program properties and, in particular, groundness. A program transformation is defined which eliminates the delay statements but still enables an accurate approximation of the behaviour of delayed goals to be traced by the analyser. An implementation has been built which shows that the analysis can be both accurate and efficient.

Download publication 328 kbytes (PostScript)

Bibtex Record

@inproceedings{508,
author = {Andrew Heaton and Pat Hill and Andy King},
title = {Analysis of {L}ogic {P}rograms with {D}elay},
month = {July},
year = {1998},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1998/508},
    publisher = {Springer-Verlag},
    refereed = {yes},
    series = {Lecture Notes in Computer Science},
    volume = {1463},
    booktitle = {Logic Programming, Synthesis and Transformation (Selected Papers)},
    editor = {N E Fuchs},
}

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

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

Last Updated: 21/03/2014