Analysing Logic Programs using "Prop"-ositional Logic Programs and a Magic Wand

Michael Codish and Bart Demoen   

The Journal of Logic Programming; 25 (3): 249-274, 1995


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 programs success patterns. Goal dependent information such as call patterns 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.

Available:    bibtex entry   compressed postscript

Related sites:   The conference version   Abstract from the publisher   PDF from Scirus - scientific search engine

Michael Codish
The Department of Computer Science
Ben-Gurion University of the Negev
PoB 653, Beer-Sheva, 84105, Israel

© copyright notice