On the practicality of global flow analysis of logic programs

作者: Saumya K. Debray , Manuel V. Hermenegildo , Richard Warren

DOI:

关键词:

摘要: This paper addresses the issue of practicality global flow analysis in logic program compilation, terms both speed and precision analysis. It discusses design implementation aspects two practical abstract interpretation-based systems: MA3, MOO Andparallel Analyzer Annotator; Ms, an experimental mode inference system developed for SB-Prolog. The also provides performance data obtained from these implementations. Based on results, it is concluded that overhead not prohibitive, while results can be quite precise useful.

参考文章(18)
Jung-Herng Chang, Doug DeGroot, Alvin M. Despain, AND-Parallelism of Logic Programs Based on a Static Data Dependency Analysis. COMPCON. pp. 218- 226 ,(1985)
Laxmikant V. Kalé, The REDUCE-OR Process Model for Parallel Evaluation of Logic Programs. international conference on lightning protection. pp. 616- 632 ,(1987)
Saumya K. Debray, David Scott Warren, Automatic Mode Inference for Prolog Programs. SLP. pp. 78- 88 ,(1986)
Maurice Bruynooghe, A framework for the abstract interpretation of logic programs Department of Computer Science, K.U.Leuven, Leuven, Belgium. ,(1987)
Doug DeGroot, Restricted AND-Parallelism. Future Generation Computer Systems. pp. 471- 478 ,(1984)
Heikki Mannila, Esko Ukkonen, Flow Analysis of Prolog Programs. SLP. pp. 205- 214 ,(1987)
Wlodzimierz Drabent, Do Logic Programs Resemble Programs in Conventional Languages SLP. pp. 289- 396 ,(1987)
C. S. Mellish, Abstract interpretation of Prolog programs international conference on logic programming. pp. 463- 474 ,(1986) , 10.1007/3-540-16492-8_95
Doug DeGroot, A Technique for Compiling Execution Graph Expressions for Restricted and Parallelism in Logic Programs international conference on supercomputing. ,vol. 5, pp. 1074- 1093 ,(1988) , 10.1016/0743-7315(88)90010-X