An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs (1998)
| Citations: | 7 - 3 self |
BibTeX
@MISC{Levi98anexperiment,
author = {Giorgio Levi and Fausto Spoto},
title = {An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We apply the methodology of domain renement to systematically derive domains for type analysis. Domains are built by iterative application of the Heyting completion operator to a given set of basic types. We give a condition on the type system which assures that two steps of iteration are sucient to reach the xpoint. Moreover, we provide a general representation for type domains through transnite formulas. Finally, we show a subset of nite formulas which can be used as a computationally feasible implementation of the domains and we dene the corresponding abstract operators. Keywords: Abstract interpretation, abstract domain, static analysis, type analysis, logic programming. 1 Introduction Type analysis for untyped logic programs is useful both to the programmer (for debugging and verication) and to the compiler (for code optimization). This is the motivation of many dierent proposals for type analysis. It is hard to compare the various techniques in terms of precisio...
