One recent advance in program development has been the application of abstract
interpretation to verify the partial correctness of a (constraint) logic program. Traditionally …

Abstract interpretation for proving safety properties summarizes concrete traces into abstract
states, thereby trading the ability to distinguish traces for tractability. Given a violation of a …

Abduction is usually carried out on partially-defined predicates. In this paper we investigate
abduction applied to fully-defined predicates, specifically linear arithmetic constraints over …

Basing program analyses on formal semantics has a long and successful tradition in the
logic programming paradigm. These analyses rely on results about the relative correctness …

The input to backwards analysis is a program together with properties that are required to
hold at given program points. The purpose of the analysis is to derive initial goals or pre …

Compact, yet complex systems and software are widely utilized, both on administrative,
organizational, and personal levels, for the processing of large amounts of data. These …

This paper presents a backward sharing analysis for logic programs. The analysis computes
pre-conditions for a query that guarantee a given post-condition is satisfied after the query is …

The question of what constraints must hold for a predicate to behave as a (partial) function,
is key to understanding the behaviour of a logic program. It has been shown how this …

Basing program analyses on formal semantics has a long and successful tradition in the
logic programming paradigm. These analyses rely on results about the relative correctness …

This paper presents an inversion of the abstract unification operator for forward set-sharing
analysis of logic programs. The inverted operator, called a backward abstract unification …