Bottom-up abstract interpretation of logic programs (1994)
| Venue: | Theoretical Computer Science |
| Citations: | 55 - 16 self |
BibTeX
@ARTICLE{Codish94bottom-upabstract,
author = {Michael Codish and Dennis Dams and Eyal Yardeni},
title = {Bottom-up abstract interpretation of logic programs},
journal = {Theoretical Computer Science},
year = {1994},
volume = {124}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract This paper presents a formal framework for the bottom-up abstract interpretation of logic programs which can be applied to approximate answer substitutions, partial an- swer substitutions and call patterns for a given program and arbitrary initial goal. The framework is based on a T P like semantics defined over a Herbrand universe with vari-ables which has previously been shown to determine the answer substitutions for arbitrary initial goals. The first part of the paper reconstructs this semantics to provide a more adequate basis for abstract interpretation. A notion of abstract substitution is introduced and shown to determine an abstract semantic function which for a given program can be applied to approximate the answer substitutions for an arbitrary initial goal.
