کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
431427 1441282 2008 27 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Tree automata with equality constraints modulo equational theories
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Tree automata with equality constraints modulo equational theories
چکیده انگلیسی

This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalized membership problem (extending the emptiness problem) is decidable by proving that the saturation of tree automata presentations with suitable paramodulation strategies terminates. Alternatively our results can be viewed as new decidable classes of first-order formula.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: The Journal of Logic and Algebraic Programming - Volume 75, Issue 2, April 2008, Pages 182-208