417 search results - page 19 / 84 » Orderings for Innermost Termination |
LOPSTR
2004
Springer
14 years 27 days ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
CADE
2001
Springer
14 years 1 days ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
CIA
2003
Springer
14 years 23 days ago
2003
Springer
Software agents are one of the building blocks of ambient intelligence and pervasive computing. Adaptation to changes in the execution context is necessary in order to provide cont...