An efficient Abstract Domain for the Static Analysis of AND-parallelism = 논리언어의 AND-병렬 태스크 추출을 위한 효율적인 추상 도메인

다국어 초록 (Multilingual Abstract)

Logic programming has many advantages as a paradigm for parallel programming since it offers ease of programming while retaining high expressive power due to its declarative semantics. In parallel logic programming, one of the important issues is the compile -time parallelism detection. Static data-dependency analysis has been widely used to gather some information needed for the detection of AND-parallelism. However, the static data-dependency analysis cannot fully detect the AND-parallelism because it does not provide some necessary functions such as the propagation of groundness. As an alternative approach, the abstract interpretation is a promising way to deal with AND-parallelism detection, while a full-blown abstract interpretation is not efficient in terms of computation since it inherently employs some complex operations not necessary for gathering the information on AND-parallelism. In this paper, we propose an abstract domain which can provide a precise and efficient way to use the abstract interpretation in the detection of AND-parallelism of logic programs.

목차 (Table of Contents)

• Contents
• ABSTRACT
• 1. Introduction
• 2. Background
• 3. Proposed Abstract Domain
• 4. Conclusion
• References