158
click to vote
RTA
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...