کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
423632 685267 2008 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Innermost Termination of Rewrite Systems by Labeling 1
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Innermost Termination of Rewrite Systems by Labeling 1
چکیده انگلیسی

Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rules. A variant of semantic labeling is predictive labeling where the quasi-model condition is only required for the usable rules. In this paper we investigate how semantic and predictive labeling can be used to prove innermost termination. Moreover, we show how to reduce the set of usable rules for predictive labeling even further, both in the termination and the innermost termination case.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 204, 4 April 2008, Pages 3-19