1716 search results - page 7 / 344 » Proving Conditional Termination |
ENTCS
2008
13 years 7 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
RTA
2007
Springer
14 years 1 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
BIRTHDAY
2007
Springer
14 years 1 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
WFLP
2009
Springer
14 years 2 months ago
2009
Springer