Abstract interpretation is a theory of semantics approximation that is used for the
construction of semantic-based program analysis algorithms (sometimes called “data flow …

Both logic programming in general and Prolog in particular have a long and fascinating
history, intermingled with that of many disciplines they inherited from or catalyzed. A large …

Since the early days of logic programming, researchers in the field realized the potential for
exploitation of parallelism present in the execution of logic programs. Their high-level …

Parallelizing logic programming has attracted much interest in the research community,
because of the intrinsic OR-and AND-parallelisms of logic programs. One research stream …

In this paper, abstract interpretation algorithms are described for computing the sharmg as
well as the freeness information about the run-time instantiations of program variables. An …

The central component of standard approaches to compile-time program analysis is an
abstract domain for approximating program values. Importantly, the domain must be chosen …

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 …

Abstract interpretation of PROLOG programs has attracted many researchers in recent
years, partly because of the potential for optimization in PROLOG compilers and partly …

A PROLOG compiler specializes the code for unification between calls and clause heads as
they appear in the program. This code could be further specialized, yielding more efficient …

We present a novel general resource analysis for logic programs based on sized types.
Sized types are representations that incorporate structural (shape) information and allow …