A New Approach to Non-termination Analysis of Logic Programs

Voets, Dean; Schreye, Danny De

doi:10.1007/978-3-642-02846-5_21

Cited by 13 publications

(35 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The subclass of queries for which a derivation to node N i is applicable is obtained by applying all substitutions on input variables from N 0 to N i . Our condition of [10] proves non-termination for every query for which the derivation to N 3 is applicable. The substitutions on input variables in the derivation to N 3 are J \ I and P \ 0.…”

Section: Moded Sld-trees and Loop Checkingmentioning

confidence: 90%

“…For every such path, two analyses are combined to identify classes of non-terminating queries. In the first phase, an adaption of our non-termination condition of [10] detects a class of queries such that each query is non-terminating or fails due to the evaluation of an integer condition such as > /2. This class of queries is a moded query with an additional integer label for variables representing unknown integers.…”

Section: Moded Sld-trees and Loop Checkingmentioning

confidence: 99%

“…This follows from the restriction that normal variables are not allowed to be substituted by terms containing integer variables or integers (third item). To prove that the proposition implies that A is moded more general than B we refer to the proof of Proposition 1 in [10].…”

Section: Theorem 2 Let N B Mmgmentioning

confidence: 99%

“…In [10], we introduced a non-termination condition identifying paths in a moded SLD-tree that can be repeated infinitely often. This approach was implemented in a system called P 2P , which proved more accurate than N T I on the benchmark of the termination competition.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Non-termination analysis of logic programs with integer arithmetics

Voets¹,

Schreye²

2011

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

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 nontermination 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.Keywords : non-termination analysis, numerical computation, constraint-based approach. * Supported by the Fund for Scientific Research -FWO-project G0561-08 Abstract. 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.

show abstract

Section: Moded Sld-trees and Loop Checkingmentioning

confidence: 90%

Section: Moded Sld-trees and Loop Checkingmentioning

confidence: 99%

Section: Theorem 2 Let N B Mmgmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Non-termination analysis of logic programs with integer arithmetics

Voets¹,

Schreye²

2011

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…The second contribution is presented by Voets, Pilozzi et al (2007). Compare to previous approaches, theirsapproach is applicable to a much larger class of CHR programs.…”

Section: Terminationmentioning

confidence: 99%

As time goes by: Constraint Handling Rules

Sneyers¹,

Weert²,

Schrijvers³

et al. 2009

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language.CHR-related research has surged during the decade following the previous survey by Frühwirth (1998). Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions and applications.

show abstract

Why Can’t You Behave? Non-termination Analysis of Direct Recursive Rules with Constraints

Frühwirth¹

2016

Rule Technologies. Research, Tools, and Applications

View full text Add to dashboard Cite

This paper is concerned with rule-based programs that go wrong. The unwanted behavior of rule applications is non-termination or failure of a computation. We propose a static program analysis of the non-termination problem for recursion in the Constraint Handling Rules (CHR) language. CHR is an advanced concurrent declarative language involving constraint reasoning. It has been closely related to many other rule-based approaches, so the results are of a more general interest. In such languages, nontermination is due to infinite applications of recursive rules. Failure is due to accumulation of contradicting constraints during the computation. We give theorems with so-called misbehavior conditions for potential non-termination and failure (as well as definite termination) of linear direct recursive simplification rules. Logical relationships between the constraints in a recursive rule play a crucial role in this kind of program analysis. We think that our approach can be extended to other types of recursion and to a more general class of rules. Therefore this paper can serve as a basic reference and a starting point for further research. This is the full version of the paper. The final publication [8] is available at Springer via http://dx.

show abstract

A New Approach to Non-termination Analysis of Logic Programs

Cited by 13 publications

References 17 publications

Non-termination analysis of logic programs with integer arithmetics

Non-termination analysis of logic programs with integer arithmetics

As time goes by: Constraint Handling Rules

Why Can’t You Behave? Non-termination Analysis of Direct Recursive Rules with Constraints

Contact Info

Product

Resources

About