We describe a new scheme for the abstract interpretation of logic programs. The scheme was developed to identify and integrate different forms of inherent parallelism in logic programs at compile time. The scheme has four components: generalization, abstract unification, summarization and concretization, algorithms for which are discussed. The abstract domain for interpretation consists of type expressions which are used as program modes. The generated mode information has been applied to identify different classes of procedures exhibiting different forms of inherent parallelism. The mode information has also been applied for detection of guards and producer-consumer relationship. The advantages and limitations of our resulting scheme are discussed.

methods

On Source-To Source Transformation of Sequentlal Logic Programs to And-Parallelism.

An abstract interpretation scheme for identifying inherent parallelism in logic programs

Delta Prolog is a concurrent logic programming language, which extends Prolog with AND-parallelism Communication and synchronization between parallel processes is established by using special control structures: event goals

background

/pdf/on-the-automatic-generation-of-events-in-delta-prolog-40d1fitemv.pdf

On the Automatic Generation of Events in Delta Prolog

This paper concerns the exploitation of user transparent inherent parallelism of pure Prolog programs using program transformation. We describe a novel paradigmenumerate-and-filter for transforming generate-and-test programs for execution under the committed-choice model extended to incorporate multiple solutions based on set enumeration. The paradigm simulates OR-parallelism by stream AND-parallelism integrating OR-parallelism, AND-parallelism, and stream parallelism. Generate-and-test programs are classified into three categories:simple generate-and-test, recursively embedded generate-and-test, and deeply intertwined generate-and-test. The intermediate programs are further transformed to reduce structure copying and metacalls. Algorithms are presented and demonstrated by transforming the representative examples of different classes of generate-and-test programs to Flat Concurrent Prolog equivalents. Statistics show that the techniques are efficient.

On Source-To Source Transformation of Sequentlal Logic Programs to And-Parallelism.

Citations

An abstract interpretation scheme for identifying inherent parallelism in logic programs

On the Automatic Generation of Events in Delta Prolog

Transforming generated-and-test programs to execute under committed-choice AND-parallelism

Related Papers (5)

Parallelism in Logic Programming.

Transformation of Logic Programs

A Compliling Approach for Exploiting And-parallelism in Parallel Logic Programming Systems

Elementary Logic Programs

A parallel implementation of logic programs