27 search results - page 1 / 6 » Inferring Termination Conditions for Logic Programs Using Ba... |
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
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 veri...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
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...
SAS
2005
Springer
13 years 10 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
ESOP
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
FLOPS
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the q...