It is important that practical data-flow analyzers are backed by reliably proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic properties for an abstract domain to be well-defined and sound with respect to the concrete semantics. In logic programming, the abstract domain Sharing is a standard choice for sharing analysis for both pract...

We show how termination of logic programs with delay declarations can be proven. Three features are distinctive of this work: (a) we assume that predicates can be used in several modes; (b) we show that block declarations, which are a very simple delay construct, are suucient; (c) we take the selection rule into account, assuming it to be as in most Prolog implementations. Our method is based o...

We show here that veriication of Prolog programs can be systematically carried out within a simple framework which comprises syntactic analysis, declarative semantics, modes and types. We apply these techniques to study termination, partial correctness, occur-check freedom, absence of errors and absence of oundering. Finally, we discuss which aspects of these techniques can be automated. Notes.

The Set-Sharing domain has been widely used to infer at compiletime interesting properties of logic programs such as occurs-check reduction, automatic parallelization, and finite-tree analysis. However, performing abstract unification in this domain requires a closure operation that increases the number of sharing groups exponentially. Much attention has been given to mitigating this key ineffi...

Diarrhea and linear growth faltering continue to burden low-income countries and are among the most important contributors to poor health during early childhood. Diarrhea is thought to adversely affect linear growth, but catch-up growth can occur if no additional insults are experienced. We sought to characterize catch-up growth in relation to diarrhea burden in a multisite dataset of 1007 chil...

Logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors i...

Sharing information between logical variables is cru cial for a lot of analyses of logic programs e g free ness analysis detection of And parallelism and occur check Therefore the development of accurate sharing domains has attracted a lot of research The sharing domain JL of Jacobs Langen which represents sub stitutions by powersets of variables is considered one of the most precise sharing do...