Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
To appear in EPTCS. Loops under Strategies ... Continued
 

Summary: To appear in EPTCS.
Loops under Strategies ... Continued
Ren´e Thiemann Christian Sternagel
University of Innsbruck
Austria
{rene.thiemann, christian.sternagel}@uibk.ac.at
J¨urgen Giesl
RWTH Aachen University
Germany
giesl@informatik.rwth-aachen.de
Peter Schneider-Kamp
University of Southern Denmark
Denmark
petersk@imada.sdu.dk
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 evaluation strategies, whereas
loop detection techniques usually do not take strategies into account. So even if a rewrite system has
a loop, it may still be terminating under certain strategies.

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences