Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

RTA
2009
Springer

favoriteEmaildiscussreport

118views Theoretical Computer Science» more RTA 2009»

Loops under Strategies

14 years 5 months ago

Loops under Strategies

Download cl-informatik.uibk.ac.at

Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily the case if one considers rewriting under strategies. Therefore, in this paper we ﬁrst generalize the notion of a loop to a loop under a given strategy. In a second step we present two novel decision procedures to check whether a given loop is a context-sensitive or an outermost loop. We implemented and successfully evaluated our method in the termination prover TTT2.

René Thiemann, Christian Sternagel

Real-time Traffic

Loop | Loop Implies Nontermination | RTA 2009 | Term Rewrite Systems | Theoretical Computer Science |

claim paper

Related Content

» Loops under Strategies Continued

» Register allocation for software pipelined multidimensional loops

» Control Strategies for the Regulation of the Eukaryotic Heat Shock Response

» A CompileTime Partitioning Strategy for NonRectangular Loop Nests

» An energy saving strategy based on adaptive loop parallelization

» Improving the parallelism of iterative methods by aggressive loop fusion

» Tracebased evaluation of clock synchronization algorithms for wireless loudspeakers

» Robust Stability Analysis and Design Under Consideration of Multiple Feedback Loops in the...

» Effective Loop Partitioning and Scheduling under Memory and Register Dual Constraints

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	RTA
Authors	René Thiemann, Christian Sternagel

Comments (0)