An abstract interpretation scheme for identifying inherent parallelism in logic programs

Search Swinburne Research Bank

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/94942

Title: An abstract interpretation scheme for identifying inherent parallelism in logic programs
Author(s): Bansal, Arvind K.; Sterling, Leon S.
Abstract: 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.
Publication type: Journal article
Source: New Generation Computing, Vol. 7, no. 2-3 (1990), pp. 273-324
Publication year: 1990
FOR Code(s): 0801 Artificial Intelligence and Image Processing; 0803 Computer Software; 1702 Cognitive Sciences
Keyword(s): Abstract interpretation; Logic programs; Parallelism
Publisher: Springer
ISSN: 0288-3635
Publisher URL: http://dx.doi.org/10.1007/BF03037209
Peer reviewed