Reachability Analysis over Term Rewriting Systems
نویسندگان
چکیده
منابع مشابه
Reachability over word rewriting systems
Word rewriting systems have been studied over the last century under several aspects. In the beginning, they were considered as a framework for the representation of computation processes and as a tool for generating formal languages. In more recent years, they have also been investigated as a mechanism to represent infinite graphs by a finite formalism. This thesis has its main focus in the la...
متن کاملReachability Analysis of Term Rewriting Systems with Timbuk -extended Version - Reachability Analysis of Term Rewriting Systems with Timbuk -extended Version
We present Timbuk a tree automata library which implements usual operations on tree automata as well as a completion algorithm used to compute an over-approximation of the set of descendants R (E) for a regular set E and a term rewriting system R, possibly non linear and non terminating. On several examples of term rewriting systems representing programs and systems to verify, we show how to us...
متن کاملProving Reachability Properties on Term Rewriting Systems with Strategies
We aim at defining regular over-approximation of sets of reachable terms for term rewriting systems applied with a strategy. In this ongoing work, we focus on innermost strategies which are the evaluation strategy of most functional programming languages. Having an accurate over-approximation of reachable terms for functional programming languages would permit to prove richer unreachability pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2004
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-004-6246-0