Completeness is an ideal, although uncommon, feature of abstract interpretations,
formalizing the intuition that, relatively to the properties encoded by the underlying abstract …

Most CLP languages designed in the past few years feature at least some combination of
constraint solving capabilities. These combinations can take multiple forms since they …

This paper describes a semantic basis for a compositional approach to the analysis of logic
programs. A logic program is viewed as consisting of a set of modules, each module …

We show how declarative diagnosis techniques can be extended to cope with verification of
operational properties, such as computed and correct answers, and of abstract properties …

We define a semantic framework to reason about properties of abstractions of SLD-
derivations. The framework allows us to address problems such as the relation between the …

In the context of standard abstract interpretation theory, a reduced relative power operation
for functionally composing abstract domains is introduced and studied. The reduced relative …

We show how declarative diagnosis techniques can be extended to cope with verification of
operational properties, such as computed answers, and of abstract properties, such as types …

The paper introduces a semantics for definite logic programs expressed in terms of SLD-
derivations and studies various properties of SLD-derivations by using the above semantics …

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 …

We define a semantic framework to reason about properties of abstractions of SLD-
derivations (observables). The framework allows us to address problems such as the …