MOVES-Seminar 22 Dec 2009, 10:00

 

Lars Noschinski

 

Automated Complexity Analysis of Term Rewrite Systems

 

Abstract:

Term Rewrite Systems are a simple programming calculus which is often
used to analyse termination. For terminating rewrite systems, the
runtime complexity is of particular interest. I present Complexity
Dependency Tuples, a modular framework for deriving feasible
complexity bounds for innermost TRS. CDTs are inspired by the
successful Dependency Pairs Framework for termination. They are designed
to allow an easy adaption of existing techniques for this Framework.