Towards more precise rewriting approximations
作者：
Highlights：
• We propose a technique for the computation of rewriting approximations.
• This technique may be used to solve reachability problems.
• We use a class of logic programs generating synchronized-context-free tree languages.
• This technique is shown sound for linear term rewrite systems.
• The termination is ensured but it may generate a strict over-approximation.
摘要
•We propose a technique for the computation of rewriting approximations.•This technique may be used to solve reachability problems.•We use a class of logic programs generating synchronized-context-free tree languages.•This technique is shown sound for linear term rewrite systems.•The termination is ensured but it may generate a strict over-approximation.
论文关键词：Term rewriting,Tree languages,Logic programming,Reachability,Rewriting approximations
论文评审过程：Received 25 June 2015, Revised 4 January 2017, Accepted 17 January 2017, Available online 31 January 2017, Version of Record 6 June 2019.
论文官网地址：https://doi.org/10.1016/j.jcss.2017.01.006
