8 search results - page 2 / 2 » Automation of Recursive Path Ordering for Infinite Labelled ... |
146
Voted
ESSLLI
2009
Springer
15 years 22 days ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
136
click to vote
RTA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
127
click to vote
AAECC
2005
Springer
15 years 2 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...