@inproceedings{a126bb301b684c7fb667391e4dae72cb,

title = "A transformational approach to prove outermost termination automatically",

abstract = "We present transformations from a generalized form of left-linear TRSs, called quasi left-linear TRSs, to TRSs such that outermost termination of the original TRS can be concluded from termination of the transformed TRS. In this way we can apply state-of-the-art termination tools for automatically proving outermost termination of any given quasi left-linear TRS. Experiments show that this works well for non-trivial examples, some of which could not be automatically proven outermost terminating before. Therefore, our approach substantially increases the class of systems that can be shown outermost terminating automatically.",

author = "M. Raffelsieper and H. Zantema",

year = "2009",

doi = "10.1016/j.entcs.2009.03.032",

language = "English",

series = "Electronic Notes in Theoretical Computer Science",

pages = "3--21",

editor = "A. Middeldorp",

booktitle = "Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2008, Castle of Hagenberg, Austria, July 14, 2008)",

}