Analysis of Downward Closed Properties of Logic Programs (2000)
| Venue: | Proc. of the International Conference on Algebraic Methodology and Software Technology, AMAST 2000, volume 1816 of Lecture |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Hill00analysisof,
author = {Patricia M. Hill and Fausto Spoto},
title = {Analysis of Downward Closed Properties of Logic Programs},
booktitle = {Proc. of the International Conference on Algebraic Methodology and Software Technology, AMAST 2000, volume 1816 of Lecture},
year = {2000},
pages = {181--196},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the analysis of downward closed properties of logic programs, which are a very abstract presentation of types. We generalise to a very large class of downward closed properties the construction of the traditional domains for groundness analysis in such a way that the results enjoy the good properties of that domain. Namely, we obtain abstract domains with a clear representation made of logical formulas and with optimal and well-known abstract operations. Moreover, they can be built using the linear refinement technique, and, therefore, are provably optimal and enjoy the condensing property, which is very important for a goal-independent analysis. Keywords: Abstract interpretation, domain theory, linear refinement, type theory, type analysis, logic programming. 1 Introduction A downward (instantiation) closed set of terms represents a property which is maintained during the computation. Therefore, it is a very abstract definition of a type. The analysis of downward ...
