A finite presentation theorem for approximating logic programs (1990) [93 citations — 15 self]
by Nevin Heintze, Joxan Jaffar
In Seventeenth Annual ACM Symposium on Principles of Programming Languages
http://www.cs.cmu.edu/afs/cs/user/nch/ftp/fpt-tr.ps.Z
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@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
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.
