Elsevier

Information and Computation

Volume 145, Issue 2, 15 September 1998, Pages 153-190
Information and Computation

Regular Article
Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements

https://doi.org/10.1006/inco.1998.2724Get rights and content
Under an Elsevier user license
open archive

Abstract

The notion of uniform closure operator is introduced, and it is shown how this concept surfaces in two different areas of application of abstract interpretation, notably in semantics design for logic programs and in the theory of abstract domain refinements. In logic programming, uniform closures permit generalization, from an order-theoretic perspective, of the standard hierarchy of declarative semantics. In particular, we show how to reconstruct the model-theoretic characterization of the well-known s-semantics using pure order-theoretic concepts only. As far as the systematic refinement operators on abstract domains are concerned, we show that uniform closures capture precisely the property of a refinement of being invertible, namely of admitting a related operator that simplifies as much as possible a given abstract domain of input for that refinement. Exploiting the same argument used to reconstruct the s-semantics of logic programming, we yield a precise relationship between refinements and their inverse operators: we demonstrate that they form an adjunction with respect to a conveniently modified complete order among abstract domains.

Keywords

uniform closure, abstract interpretation, logic program semantics, abstract domain refinement

Cited by (0)