Analysis of Logic Programs with Delay

Heaton, Andrew and Hill, Pat and King, Andy (1998) Analysis of Logic Programs with Delay. In: Fuchs, Norbert, ed. Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, 1463 . Springer-Verlag, pp. 148-167. ISBN 978-3-540-65074-4. (doi:10.1007/3-540-49674-2_8) (KAR id:21640)

PDF Language: English
Click to download this file (0B) Preview	Preview
This file may not be suitable for users of assistive technology. Request an accessible format
Official URL: http://dx.doi.org/10.1007/3-540-49674-2_8

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.

Item Type:	Book section
DOI/Identification number:	10.1007/3-540-49674-2_8
Additional information:	Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html
Uncontrolled keywords:	abstract interpretation, logic programming
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Andy King
Date Deposited:	22 Aug 2009 18:58 UTC
Last Modified:	16 Nov 2021 10:00 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/21640 (The current URI for this page, for reference purposes)
King, Andy:	https://orcid.org/0000-0001-5806-4822

Depositors only (login required):

Altmetric

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.