کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4951489 | 1364358 | 2017 | 33 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Dependency pairs for proving termination properties of conditional term rewriting systems
ترجمه فارسی عنوان
جفت وابستگی برای اثبات خواص ختم شدن سیستم های بازنویسی شرطی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
بازنویسی اصطلاحات مشروط، جفت وابستگی، تجزیه و تحلیل برنامه، خاتمه عملیات،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
The notion of operational termination provides a logic-based definition of termination of computational systems as the absence of infinite inferences in the computational logic describing the operational semantics of the system. For Conditional Term Rewriting Systems we show that operational termination is characterized as the conjunction of two termination properties. One of them is traditionally called termination and corresponds to the absence of infinite sequences of rewriting steps (a horizontal dimension). The other property, that we call V-termination, concerns the absence of infinitely many attempts to launch the subsidiary processes that are required to perform a single rewriting step (a vertical dimension). We introduce appropriate notions of dependency pairs to characterize termination, V-termination, and operational termination of Conditional Term Rewriting Systems. This can be used to obtain a powerful and more expressive framework for proving termination properties of Conditional Term Rewriting Systems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Logical and Algebraic Methods in Programming - Volume 86, Issue 1, January 2017, Pages 236-268
Journal: Journal of Logical and Algebraic Methods in Programming - Volume 86, Issue 1, January 2017, Pages 236-268
نویسندگان
Salvador Lucas, José Meseguer,