TY - GEN
T1 - Goal dependent vs. Goal independent analysis of logic programs
AU - Codish, M.
AU - García de la Bands, M.
AU - Bruynooghc, M.
AU - Hermenegildo, M.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1994.
PY - 1994/1/1
Y1 - 1994/1/1
N2 - Goal independent analysis of logic programs is commonly discussed in the context of the bottom-up approach. However, while the literature is rich in descriptions of top-down analysers and their application, practical experience with bottom-up analysis is still in a preliminary stage. Moreover, the practical use of existing top-down frameworks for goal independent analysis has not been addressed in a practical system. We illustrate the efficient use of existing goal dependent, top-down frameworks for abstract interpretation in performing goal independent analyses of logic programs much the same as those usually derived from bottom-up frameworks. We present several optimizations for this flavour of top-down analysis. The approach is fully implemented within an existing top-down framework. Several implementation tradeoffs are discussed as well as the influence of domain characteristics. An experimental evaluation including a comparison with.a bottom-up analysis for the domain Prop is presented. We conclude that the technique can offer advantages with respect to standard goal dependent analyses.
AB - Goal independent analysis of logic programs is commonly discussed in the context of the bottom-up approach. However, while the literature is rich in descriptions of top-down analysers and their application, practical experience with bottom-up analysis is still in a preliminary stage. Moreover, the practical use of existing top-down frameworks for goal independent analysis has not been addressed in a practical system. We illustrate the efficient use of existing goal dependent, top-down frameworks for abstract interpretation in performing goal independent analyses of logic programs much the same as those usually derived from bottom-up frameworks. We present several optimizations for this flavour of top-down analysis. The approach is fully implemented within an existing top-down framework. Several implementation tradeoffs are discussed as well as the influence of domain characteristics. An experimental evaluation including a comparison with.a bottom-up analysis for the domain Prop is presented. We conclude that the technique can offer advantages with respect to standard goal dependent analyses.
UR - http://www.scopus.com/inward/record.url?scp=0040619654&partnerID=8YFLogxK
U2 - 10.1007/3-540-58216-9_46
DO - 10.1007/3-540-58216-9_46
M3 - Conference contribution
AN - SCOPUS:0040619654
SN - 9783540582168
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 305
EP - 319
BT - Logic Programming and Automated Reasoning - 5th International Conference, LPAR 1994, Proceedings
A2 - Pfenning, Frank
PB - Springer Verlag
T2 - 5th International Conferenceon Logic Programming and Automated Reasoning, LPAR 1994
Y2 - 16 July 1994 through 22 July 1994
ER -