arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.05923cs.PLcs.FL
收藏

交错双向Dyck可达性的判定性和复杂性

The Decidability and Complexity of Interleaved Bidirected Dyck Reachability

Adam Husted Kjelstrøm, Andreas Pavlogiannis

摘要:

Dyck可达性是静态分析的标准公式,因为它实现了精度和效率之间的最佳点,因此得到了广泛的研究。交织Dyck可达性(表示为$D_k\odot D_k$)使用两种Dyck语言以提高精度(例如,上下文和字段敏感性),但众所周知是不可判定的。由于许多静态分析产生某种类型的双向图,它们产生交错双向Dyck可达性问题。虽然这些问题已经有了许多应用,但它们的可判定性和复杂性在很大程度上仍然是开放的。在最近的工作中,Li等人在这个方向上迈出了第一步,表明(i)$D_1\odot D_1$可达性(即,当两种Dyck语言都在单个括号上并充当计数器时)在$O(n^7)$时间内是可计算的,而(ii)$D_k\odot D_k$可达性是NP难的。在这项工作中,我们解决的可判定性和复杂性的交织双向戴克可达性的所有变种。首先,我们表明,$D_1\odot D_1$的可达性可以计算在$O(n^3\cdot α(n))$的时间,显着提高了现有的$O(n^7)$界。其次,我们证明了$D_k\odot D_1$的可达性(即,当一种语言充当计数器时)是可判定的,这与可判定性是开放的非双向情况相反。我们进一步考虑$D_k\odot D_1$的可达性,计数器保持线性有界。我们的第三个结果表明,这个有界变量可以解决$O(n^2\cdot α(n))$时间,而我们的第四个结果表明,该问题有一个(条件)二次下界,因此我们的上限是本质上最优的。第五,我们证明了完整的$D_k\odot D_k$可达性是不可判定的。这改进了最近的NP-困难下界,并表明该问题是等价的非双向的情况。

英文摘要:

Dyck reachability is the standard formulation of a large domain of static analyses, as it achieves the sweet spot between precision and efficiency, and has thus been studied extensively. Interleaved Dyck reachability (denoted $D_k\odot D_k$) uses two Dyck languages for increased precision (e.g., context and field sensitivity) but is well-known to be undecidable. As many static analyses yield a certain type of bidirected graphs, they give rise to interleaved bidirected Dyck reachability problems. Although these problems have seen numerous applications, their decidability and complexity has largely remained open. In a recent work, Li et al. made the first steps in this direction, showing that (i) $D_1\odot D_1$ reachability (i.e., when both Dyck languages are over a single parenthesis and act as counters) is computable in $O(n^7)$ time, while (ii) $D_k\odot D_k$ reachability is NP-hard. In this work we address the decidability and complexity of all variants of interleaved bidirected Dyck reachability. First, we show that $D_1\odot D_1$ reachability can be computed in $O(n^3\cdot α(n))$ time, significantly improving over the existing $O(n^7)$ bound. Second, we show that $D_k\odot D_1$ reachability (i.e., when one language acts as a counter) is decidable, in contrast to the non-bidirected case where decidability is open. We further consider $D_k\odot D_1$ reachability where the counter remains linearly bounded. Our third result shows that this bounded variant can be solved in $O(n^2\cdot α(n))$ time, while our fourth result shows that the problem has a (conditional) quadratic lower bound, and thus our upper bound is essentially optimal. Fifth, we show that full $D_k\odot D_k$ reachability is undecidable. This improves the recent NP-hardness lower-bound, and shows that the problem is equivalent to the non-bidirected case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑