Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand

Michael Codish, Bart Demoen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper illustrates the role of a class of "prop"-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding "prop"- ositional logic programs which approximate the original programs and have finite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretation using the domain Prop.
The main contribution is in the ease in which a highly efficient implementation of the analysis is obtained. The implementation is bottom-up and provides approximations of a program's success patterns. Goal-dependent information such as callpatterns is obtained using a magic-set transformation. A novel compositional approach is applied so that call patterns for arbitrary goals are derived in a precise and efficient way.
Original languageEnglish GB
Title of host publicationLogic Programming, Proceedings of the 1993 International Symposium, Vancouver, British Columbia, Canada, October 26-29, 1993
EditorsDale Miller
PublisherMIT Press Journals
Pages114-129
Number of pages16
StatePublished - 1993

Cite this