Non-termination Analysis of Logic Programs Using Types
In recent years techniques and systems have been developed to prove non-termination of logic programs for certain classes of queries. In previous work, we developed such a system based on mode-information and a form of loop checking performed at compile time.
In the current paper we improve this technique by integrating type information in the analysis and by applying non-failure analysis and program specialization. It turns out that there are several classes of programs for which existing non-termination analyzers fail and for which our extended technique succeeds in proving non-termination.
Keywordsnon-termination analysis types non-failure analysis program specialization
Unable to display preview. Download preview PDF.
- 2.Debray, S.K., López-García, P., Hermenegildo, M.V.: Non-failure analysis for logic programs. In: ICLP, pp. 48–62 (1997)Google Scholar
- 5.Nguyen, M.T., Bruynooghe, M., De Schreye, D., Leuschel, M.: Program specialisation as a preprocessing step for termination analysis. In: Geser, A., Sondergaard, H. (eds.) WST 2006, pp. 7–11 (2006)Google Scholar