437 search results - page 22 / 88 » Proving Termination by Divergence |
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
RTA
1991
Springer
13 years 11 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
ICLP
1997
Springer
14 years 1 days ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
RTA
1993
Springer
13 years 12 months ago
1993
Springer
Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving...
FUIN
2008
13 years 8 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...