Non-termination Analysis of Logic Programs with Integer arithmetics

Details Non-termination Analysis of Logic Programs with Integer arithmetics Non-termination Analysis of Logic Programs with Integer arithmetics

2011-09-15

arxiv.org/abs/1109.3256v1

TPLP, 2011, volume 11, number 4-5, pages 521 --536

Computer Science

Programming Languages

15 pages, 2 figures, journal TPLP (special issue on the international conference of logic programming)

Scientific paper

10.1017/S1471068411000159

In the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog programs is limited because most Prolog programs use non-logical features. As a first step towards the analysis of Prolog programs, this paper presents a non-termination condition for Logic Programs containing integer arithmetics. The analyzer is based on our non-termination analyzer presented at ICLP 2009. The analysis starts from a class of queries and infers a subclass of non-terminating ones. In a first phase, we ignore the outcome (success or failure) of the arithmetic operations, assuming success of all arithmetic calls. In a second phase, we characterize successful arithmetic calls as a constraint problem, the solution of which determines the non-terminating queries.

Affiliated with

Also associated with

No associations

Rating

Non-termination Analysis of Logic Programs with Integer arithmetics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Non-termination Analysis of Logic Programs with Integer arithmetics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-termination Analysis of Logic Programs with Integer arithmetics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-672405