Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements |
| |
Authors: | Roberto Giacobazzi Francesco Ranzato |
| |
Affiliation: | aDipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italyf1;bDipartimento di Matematica Pura ed Applicata, Università di Padova, Via Belzoni 7, 35131, Padova, Italyf2 |
| |
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 |
本文献已被 ScienceDirect 等数据库收录! |
|