Topics
logicOrganisation
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to verify termination for a specified mode. The contribution is a methodology which combines traditional termination analysis and backwards analysis to obtain termination inference. We demonstrate the application of this methodology to enhance a termination analyzer to perform also termination inference
We present cTI, the first system for universal left-termination inference of logic programs. Termina...
This paper introduces a modular framework for termination analysis of logic programming. To this end...
Termination is an important and well-studied property for logic programs. However, almost all approa...
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. ...
Current norm-based automatic termination analysis techniques for logic programs can be split up into...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
This article makes two contributions to the work on semantics-based termination analysis for logic p...
We present an approximation framework for attacking the undecidable termination prob-lem of logic pr...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
This paper makes two contributions to the work on semantics based termination analysis for logic pro...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
We present an approximation framework for attacking the undecidable termination problem of logic pro...
Progress on automated termination detection for logic programs is reported. The prospects for handli...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
Previous works have shown that analysing the structure of logic programs may provide useful informat...
We present cTI, the first system for universal left-termination inference of logic programs. Termina...
This paper introduces a modular framework for termination analysis of logic programming. To this end...
Termination is an important and well-studied property for logic programs. However, almost all approa...
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. ...
Current norm-based automatic termination analysis techniques for logic programs can be split up into...
Termination is well-known to be one of the most intriguing aspects of program verification. Since lo...
This article makes two contributions to the work on semantics-based termination analysis for logic p...
We present an approximation framework for attacking the undecidable termination prob-lem of logic pr...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
This paper makes two contributions to the work on semantics based termination analysis for logic pro...
AbstractWe survey termination analysis techniques for Logic Programs. We give an extensive introduct...
We present an approximation framework for attacking the undecidable termination problem of logic pro...
Progress on automated termination detection for logic programs is reported. The prospects for handli...
There are two kinds of approaches for termination analysis of logic programs: transformational and...
Previous works have shown that analysing the structure of logic programs may provide useful informat...
We present cTI, the first system for universal left-termination inference of logic programs. Termina...
This paper introduces a modular framework for termination analysis of logic programming. To this end...
Termination is an important and well-studied property for logic programs. However, almost all approa...
Add to ORKG