Sciweavers

1716 search results - page 9 / 344
» Proving Conditional Termination
Sort
View
CADE
2006
Springer
13 years 11 months ago
Matrix Interpretations for Proving Termination of Term Rewriting
Jörg Endrullis, Johannes Waldmann, Hans Zante...
ICLP
2009
Springer
13 years 5 months ago
Proving Termination by Invariance Relations
Paolo Pilozzi, Danny De Schreye
ESOP
2000
Springer
13 years 11 months ago
Polyvariant Flow Analysis with Constrained Types
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
Scott F. Smith, Tiejun Wang
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 2 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 ...