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

A practical procedure for computing a regular approximation of a logic program is given.
Regular approximations are useful in a variety of tasks in debugging, program specialisation …

We show how precise groundness information can be extracted from logic programs. The
idea is to use abstract interpretation with Boolean functions as “approximations” to …

This paper presents a general-purpose framework for the abstract interpretation of logic
programs and applies it to the problem of automatically extracting independent AND …

Global analyzers traditionally read and analyze the entire program at once, in a
nonincremental way. However, there are many situations which are not well suited to this …

Global analyzers traditionally read and analyze the entire program at once, in a non-
incremental way. However, there are many situations which are not well suited to this simple …

We present simple and powerful generalized algebraic semantics for constraint logic
programs that are parameterized with respect to the underlying constraint system. The idea …

Many static analyses for declarative programming/database languages use Boolean
functions to express dependencies among variables or argument positions. Examples …

This paper illustrates the role of a class of “prop”-ositional logic programs in the analysis of
complex properties of logic programs. Analyses are performed by abstracting Prolog …

Abstract interpretation-based data-flow analysis of logic programs is, at this point, relatively
well understood from the point of view of general frameworks and abstract domains. On the …