Abstract

All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to their restricted power. To overcome this limitation the article introduces a modular framework which allows to infer (polynomial) upper bounds on the complexity of term rewrite systems by combining different criteria. Since the fundamental idea is based on relative rewriting, we study how matrix interpretations and match-bounds can be used and extended to measure complexity for relative rewriting, respectively. The modular framework is proved strictly more powerful than the conventional setting. Furthermore, the results have been implemented and experiments show significant gains in power.

BibTeX

@article{HZMK-LMCS14,
  author  = "Harald Zankl and Martin Korp",
  title   = "Modular Complexity Analysis for Term Rewriting",
  journal = "Logical Methods in Computer Science",
  volume  = 10,
  number  = 1:19,
  pages   = "1--34",
  year    = 2014
}