Inferring Termination Conditions for Logic Programs Using Backwards Analysis

Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs

We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference generalizes termination analysis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With te...

Inference of termination conditions

Numerical computations form an essential part of almost any real-world program. Clearly, in order for a termination analyser to be of practical use it should contain a mechanism for inferring termination of such computations. However, this topic attracted less attention of the research community. In works of Der-showitz et al. 5] and Ruggieri 9] such termination analysis techniques were present...

Analysing Logic Programs by Reasoning Backwards

One recent advance in program development has been the application of abstract interpretation to verify the partial correctness of a (constraint) logic program. Traditionally forwards analysis has been applied that starts with an initial goal and traces the execution in the direction of the control-flow to approximate the program state at each program point. This is often enough to verify asser...

Inferring Termination Conditions for Logi Programs using Ba kwards Analysis

Java bytecode Verification using Analysis and Transformation of Logic Programs

State of the art analyzers in the (Constraint) Logic Programming paradigm (or (C)LP for short) are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, run-time error freeness, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verificatio...