TY - JOUR
T1 - Global flow analysis as a practical compilation tool
AU - Hermenegildo, M. V.
AU - Warren, R.
AU - Debray, S. K.
N1 - Funding Information:
*A preliminary version of this paper appeared in Proceedingso f the 1988 International Conferenceo n Logic Programming. The work of M. V. Hermenegildo was supported in part by MCC’s Deductive Computing Laboratory and also in part by ESPRIT project 2471 PEPMA. The work of S. K. Debray was supported in part by the National Science Foundation under grant number CCR-8702939. Address correspondenceto M. V. Hermenegildo, Facultad de Informatica, Universidad Politecnica de Madrid, 28660-Boadilla de1 Monte, Madrid, Spain. E-mail: [email protected] or [email protected]. Received June 1990; accepted February 1991.
PY - 1992/8
Y1 - 1992/8
N2 - This paper addresses the issue of the practicality of global flow analysis in logic program compilation, in terms of speed of the analysis, precision, and usefulness of the information obtained. To this end, design and implementation aspects are discussed for two practical abstract interpretation-based flow analysis systems: MA3, the MCC And-parallel Analyzer and Annotator; and Ms, an experimental mode inference system developed for SB-Prolog. The paper also provides performance data obtained from these implementations and, as an example of an application, a study of the usefulness of the mode information obtained in reducing run-time checks in independent and-parallelism. Based on the results obtained, it is concluded that the overhead of global flow analysis is not prohibitive, and the results of analysis can be quite precise and useful.
AB - This paper addresses the issue of the practicality of global flow analysis in logic program compilation, in terms of speed of the analysis, precision, and usefulness of the information obtained. To this end, design and implementation aspects are discussed for two practical abstract interpretation-based flow analysis systems: MA3, the MCC And-parallel Analyzer and Annotator; and Ms, an experimental mode inference system developed for SB-Prolog. The paper also provides performance data obtained from these implementations and, as an example of an application, a study of the usefulness of the mode information obtained in reducing run-time checks in independent and-parallelism. Based on the results obtained, it is concluded that the overhead of global flow analysis is not prohibitive, and the results of analysis can be quite precise and useful.
UR - http://www.scopus.com/inward/record.url?scp=0000099377&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0000099377&partnerID=8YFLogxK
U2 - 10.1016/0743-1066(92)90053-6
DO - 10.1016/0743-1066(92)90053-6
M3 - Article
AN - SCOPUS:0000099377
SN - 0743-1066
VL - 13
SP - 349
EP - 366
JO - The Journal of Logic Programming
JF - The Journal of Logic Programming
IS - 4
ER -