172 search results - page 4 / 35 » Automatic Termination Analysis of Logic Programs |
LOPSTR
2007
Springer
15 years 3 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
103
Voted
ITP
2010
14 years 11 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
LOPSTR
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
175
click to vote
POPL
2005
ACM
15 years 9 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...