ANALYZING LOGIC PROGRAMS USING PROP-OSITIONAL LOGIC PROGRAMS AND A MAGIC WAND

This paper illustrates the role of a class of ''prop''-ositional logic programs in the analysis of complex properties of logic programs. Ana lyses are performed by abstracting Prolog programs to corresponding '' prop''-ositional logic programs which approximate the original program s and have finite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretation using the doma in Prop. The main contribution is in the ease in which a highly effici ent implementation of the analysis is obtained. The implementation is bottom-up and provides approximations of a program's success patter-os . Goal-dependent information such as call patterns is obtained using a magic-set transformation. A novel compositional approach is applied s o that call patterns for arbitrary goals are derived in a precise and efficient way.