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.

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
}