Static Analysis of AND-parallelism in Logic Programs based on Abstract Interpretation

추상해석법을 이용한 논리언어의 AND-병렬 태스크 추출 기법

  • Kim, Hiecheol (Division of Computer & Communication Engineering Taegu University) ;
  • Lee, Yong-Doo (Division of Computer & Communication Engineering Taegu University)
  • Published : 1997.11.01

Abstract

Logic programming has many advantages as a paradigm for parallel programming because 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 AND-parallelism because it does not provide some necessary functions such as the propagation of groundness. As an alternative approach, abstract interpretation provides 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 for the detection of AND-parallelism of logic programs.

Keywords