Loops under Strategies ... Continued


While there are many approaches for automatically proving termination of term rewrite systems, up to now there exist only few techniques to disprove their termination automatically. Almost all of these techniques try to find loops, where the existence of a loop implies non-termination of the rewrite system. However, most programming languages use specific… (More)
DOI: 10.4204/EPTCS.44.4


2 Figures and Tables

Cite this paper

@inproceedings{Thiemann2010LoopsUS, title={Loops under Strategies ... Continued}, author={Ren{\'e} Thiemann and Christian Sternagel and J{\"{u}rgen Giesl and Peter Schneider-Kamp}, booktitle={IWS}, year={2010} }