Analysis of Logic Programs with Delay

Heaton, A. and Hill, P.M. and King, A.M. (1998) Analysis of Logic Programs with Delay. In: Fuchs, N.E., ed. Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, 1463. Springer-Verlag pp. 148-167. ISBN 978-3-540-65074-4.

PDF
Download (216Kb)
[img]
Preview
Postscript
Download (328Kb)
[img]
Preview
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: Conference or workshop item (Paper)
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: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 22 Aug 2009 18:58
Last Modified: 25 Jun 2012 10:15
Resource URI: http://kar.kent.ac.uk/id/eprint/21640 (The current URI for this page, for reference purposes)
  • Depositors only (login required):