School of Computing

Widening pos for efficient and scalable groundness analysis of logic programs

Mike Codish, Andy Heaton, and Andy King

Technical Report 16-97, University of Kent at Canterbury, December 1997.

Abstract

Positive (Pos) and definite (Def) Boolean functions have been successfully applied to infer dependencies between the variables of a logic program. Two new analysis techniques for Boolean functions are presented. The first is an easy to implement, fast and scalable technique for the goal dependent analysis of logic programs. It is based on widening Pos. The second technique is based on using linear constraints to represent formulae in Def. The resulting analysis is both easy to implement and precise. It is more suited to the analysis of constraint programs.

Download publication 184 kbytes (PostScript)

Bibtex Record

@techreport{515,
author = {Mike Codish and Andy Heaton and Andy King},
title = {Widening Pos for Efficient and Scalable Groundness Analysis of Logic Programs},
month = {December},
year = {1997},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1997/515},
    institution = {University of Kent at Canterbury},
    number = {16-97},
    type = {Technical Report},
}

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

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

Last Updated: 21/03/2014