License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2015.160
URN: urn:nbn:de:0030-drops-51952
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5195/
Go to the corresponding LIPIcs Volume Portal

Endrullis, Jörg ; Zantema, Hans

Proving non-termination by finite automata

pdf-format:
15.pdf (0.6 MB)

Abstract

A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language of terms that is closed under rewriting and does not contain normal forms. It is automated by representing the language by a tree automaton with a fixed number of states, and expressing the mentioned requirements in a SAT formula. Satisfiability of this formula implies non-termination. Our approach succeeds for many examples where all earlier techniques fail, for instance for the S-rule from combinatory logic.

BibTeX - Entry

@InProceedings{endrullis_et_al:LIPIcs:2015:5195,
  author =	{J{\"o}rg Endrullis and Hans Zantema},
  title =	{{Proving non-termination by finite automata}},
  booktitle =	{26th International Conference on Rewriting Techniques and Applications (RTA 2015)},
  pages =	{160--176},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-85-9},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{36},
  editor =	{Maribel Fern{\'a}ndez},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5195},
  URN =		{urn:nbn:de:0030-drops-51952},
  doi =		{10.4230/LIPIcs.RTA.2015.160},
  annote =	{Keywords: non-termination, finite automata, regular languages}
}

Keywords: non-termination, finite automata, regular languages
Collection: 26th International Conference on Rewriting Techniques and Applications (RTA 2015)
Issue Date: 2015
Date of publication: 18.06.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI