29 search results - page 6 / 6 » Termination of Innermost Context-Sensitive Rewriting Using D... |
108
Voted
FROCOS
2007
Springer
15 years 7 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...
102
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
107
Voted
SOFSEM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
122
Voted
AISC
2008
Springer
15 years 3 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...