On Implementing Modular Complexity Analysis

6 pages•Published: May 15, 2012

Abstract

We recall the recent approach by (Zankl and Korp, 2010) to prove upper bounds on the (derivational) complexity of term rewrite systems modularly. In this note we show that this approach is suitable to tighten bounds after they have been established. The idea is to replace proof steps with a large bound by (new) proofs that yield smaller bounds. An evaluation of the approach shows the benefits.

Keyphrases: complexity analysis, derivational complexity, term rewriting

In: Geoff Sutcliffe, Stephan Schulz and Eugenia Ternovska (editors). IWIL 2010. The 8th International Workshop on the Implementation of Logics, vol 2, pages 42-47.

Links:	https://easychair.org/publications/paper/1Pwb
	https://doi.org/10.29007/zm9s

BibTeX entry

@inproceedings{IWIL2010:Implementing_Modular_Complexity_Analysis,
  author    = {Harald Zankl and Martin Korp},
  title     = {On Implementing Modular Complexity Analysis},
  booktitle = {IWIL 2010. The 8th International Workshop on the Implementation of Logics},
  editor    = {Geoff Sutcliffe and Stephan Schulz and Eugenia Ternovska},
  series    = {EPiC Series in Computing},
  volume    = {2},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/1Pwb},
  doi       = {10.29007/zm9s},
  pages     = {42-47},
  year      = {2012}}

Download PDF Open PDF in browser