A Finite Presentation Theorem for Approximating Logic Programs (1990)
| Venue: | In Seventeenth Annual ACM Symposium on Principles of Programming Languages |
| Citations: | 90 - 15 self |
BibTeX
@INPROCEEDINGS{Heintze90afinite,
author = {Nevin Heintze and Joxan Jaffar},
title = {A Finite Presentation Theorem for Approximating Logic Programs},
booktitle = {In Seventeenth Annual ACM Symposium on Principles of Programming Languages},
year = {1990},
pages = {197--209},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In program analysis, a key notion used to approximate the meaning of a program is that of ignoring inter-variable dependencies. We formalize this notion in logic programming in order to define an approximation to the meaning of a program. The main result proves that this approximation is not only recursive, but that it can be finitely represented in the form of a cyclic term graph. This explicit representation can be used as a starting point for logic program analyzers. A preliminary version appears in the Proceedings, 17 th ACM Symposium on POPL. y School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213-3890 z IBM Thomas J. Watson Research Center, PO Box 218, Yorktown Heights, NY 10598 Section 1: Introduction 1 1 Introduction The problem at hand is: given a logic program, obtain an approximation of its meaning, that is, obtain an approximation of its least model. The definition of the approximation should be declarative (so that results can be proved ab...
