Liveness Verification in TRSs Using Tree Automata and Termination Analysis
نویسندگان
چکیده
This paper considers verification of the liveness property Live(R, I,G) for a term rewrite system (TRS) R, where I (Initial states) and G (Good states) are two sets of ground terms represented by finite tree automata. Considering I and G, we transform R to a new TRS R′ such that termination of R′ proves the property Live(R, I, G).
منابع مشابه
Simulating liveness by reduction strategies
We define a general framework to handle liveness and related properties by reduction strategies in abstract reduction and term rewriting. Classically, reduction strategies in rewriting are used to simulate the evaluation process in programming languages. The aim of our work is to use reduction strategies to also study liveness questions which are of high importance in practice (e.g., in protoco...
متن کاملLiveness in Rewriting
In this paper, we show how the problem of verifying liveness properties is related to termination of term rewrite systems (TRSs). We formalize liveness in the framework of rewriting and present a sound and complete transformation to transform particular liveness problems into TRSs. Then the transformed TRS terminates if and only if the original liveness property holds. This shows that liveness ...
متن کاملSome Classes of Term Rewriting Systems for which Termination is Decidable
Termination is one of the central properties of term rewriting systems (TRSs for short). A TRS is called terminating if it does not admit any infinite rewrite sequence. The efforts to find classes of TRSs whose termination is decidable have been made for decades and several positive results have been proposed, for example, right-ground TRSs and right-linear shallow TRSs. In this research, we st...
متن کاملTermination property of inverse finite path overlapping term rewriting system is decidable
We propose a new decidable subclass of term rewriting systems (TRSs) for which strongly normalizing (SN) property is decidable. The new class is called almost orthogonal inverse finite path overlapping TRSs (AO-FPO−1-TRSs) and the class properly includes AO growing TRSs for which SN is decidable. Tree automata technique is used to show that SN is decidable for AO-FPO−1-TRSs.
متن کاملProving Liveness with Fairness Using Rewriting
We show how the problem of verifying liveness properties in fair computations is related to relative termination of term rewrite systems (TRSs), extending [3]. We present a new transformation that is stronger than the sound transformation introduced in [3]. On the one hand we show a completeness result under some mild conditions. On the other hand we show how our transformation applies to examp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computing and Informatics
دوره 29 شماره
صفحات -
تاریخ انتشار 2010