cl-banner

Modular Complexity Analysis via Relative Complexity

Harald Zankl and Martin Korp

Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010), Leibniz International Proceedings in Informatics 6, pp. 385 – 400, 2010.

Abstract

In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining different criteria. All current investigations to analyze the derivational complexity are based on a single termination proof, possibly preceded by transformations. We prove that the modular framework is strictly more powerful than the conventional setting. Furthermore, the results have been implemented and experiments show significant gains in power.

 

  PDF |    doi:10.4230/LIPIcs.RTA.2010.385  |  © Creative Commons License – NC – ND

BibTeX 

@inproceedings{HZMK-RTA10,
author = "Harald Zankl and Martin Korp",
title = "Modular Complexity Analysis via Relative Complexity",
booktitle = "Proceedings of the 21st International Conference on
Rewriting Techniques and Applications",
series = "Leibniz International Proceedings in Informatics",
volume = 6,
pages = "385--400",
year = 2010
}
Nach oben scrollen