{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:36:56Z","timestamp":1725485816548},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.29007\/zm9s","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:34Z","timestamp":1516730254000},"page":"42-35","source":"Crossref","is-referenced-by-count":0,"title":["On Implementing Modular Complexity Analysis"],"prefix":"10.29007","volume":"2","author":[{"given":"Harald","family":"Zankl","sequence":"first","affiliation":[]},{"given":"Martin","family":"Korp","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"IWIL 2010. The 8th International Workshop on the Implementation of Logics"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:57:34Z","timestamp":1516730254000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/1Pwb"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/zm9s","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}