Sciweavers

213 search results - page 11 / 43
» Automated Termination Analysis for Logic Programs with Cut
Sort
View
ICLP
2010
Springer
15 years 1 months ago
Program analysis for code duplication in logic programs
Abstract. In this PhD project, we deal with the issue of code duplication in logic programs. In particular semantical duplication or redundancy is generally viewed as a possible se...
Celine Dandois
CADE
2007
Springer
15 years 3 months ago
Proving Termination by Bounded Increase
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
Jürgen Giesl, René Thiemann, Stephan S...
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
15 years 4 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...