34 search results - page 5 / 7 » TORPA: Termination of Rewriting Proved Automatically |
WFLP
2009
Springer
14 years 4 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
CADE
2001
Springer
14 years 2 months 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...
RTA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
RTA
2005
Springer
14 years 3 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
CADE
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...