Dependency pairs and polynomial path orders
M Avanzini, G Moser - International Conference on Rewriting Techniques …, 2009 - Springer
International Conference on Rewriting Techniques and Applications, 2009•Springer
We show how polynomial path orders can be employed efficiently in conjunction with weak
innermost dependency pairs to automatically certify polynomial runtime complexity of term
rewrite systems and the polytime computability of the functions computed. The established
techniques have been implemented and we provide ample experimental data to assess the
new method.
innermost dependency pairs to automatically certify polynomial runtime complexity of term
rewrite systems and the polytime computability of the functions computed. The established
techniques have been implemented and we provide ample experimental data to assess the
new method.
Abstract
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the functions computed. The established techniques have been implemented and we provide ample experimental data to assess the new method.
Springer
Showing the best result for this search. See all results