Computer Science – Logic in Computer Science
Scientific paper
2010-12-27
EPTCS 44, 2010, pp. 51-65
Computer Science
Logic in Computer Science
In Proceedings IWS 2010, arXiv:1012.5337
Scientific paper
10.4204/EPTCS.44.4
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. Therefore, our goal is to develop decision procedures which can determine whether a given loop is also a loop under the respective evaluation strategy. In earlier work, such procedures were presented for the strategies of innermost, outermost, and context-sensitive evaluation. In the current paper, we build upon this work and develop such decision procedures for important strategies like leftmost-innermost, leftmost-outermost, (max-)parallel-innermost, (max-)parallel-outermost, and forbidden patterns (which generalize innermost, outermost, and context-sensitive strategies). In this way, we obtain the first approach to disprove termination under these strategies automatically.
Giesl Jürgen
Schneider-Kamp Peter
Sternagel Christian
Thiemann René
No associations
LandOfFree
Loops under Strategies ... Continued does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Loops under Strategies ... Continued, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Loops under Strategies ... Continued will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-22466