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

安全验证的细粒度复杂性

Fine-Grained Complexity of Safety Verification

Peter Chini, Roland Meyer, Prakash Saivasan

摘要:

我们研究了细粒度的复杂性的领导贡献者可达性(LCR)和有界阶段可达性(BSR),两个变种的安全验证问题的共享内存并发程序。对于这两个问题,内存是有限数据域上的单个变量。我们的贡献是新的验证算法和下界。后者基于指数时间假设(ETH),问题集覆盖和交叉组合。LCR是一个指定的领导者线程在与一定数量的同等贡献者线程交互时是否会达到不安全状态的问题。我们建议两个参数化:(1)通过数据域D的大小和领导者L的大小,以及(2)通过贡献者C的大小。我们提出了这两种情况下的算法。其关键技术是紧凑证人和动态规划。算法的运行时间为O*((L(D+1))^(LD)* D^D)和O*(2^C),这表明两种参数化都是固定参数的。我们通过(匹配)基于ETH和Set Cover的下界来补充上界。此外,我们证明了多项式核的情况下。对于BSR,我们考虑涉及t个不同线程的程序。我们将分析限制在写权限在线程之间更改s次的计算上。BSR询问给定的配置是否可以通过这样的s阶段计算到达。当用P(线程的最大大小)和t参数化时,有趣的观察是,问题有大量的困难实例。形式上,我们表明,没有多项式核,没有压缩算法,减少数据域D的大小或阶段s的数量多项式依赖于P和t。这表明,符号方法可能更难找到这个问题。

英文摘要:

We study the fine-grained complexity of Leader Contributor Reachability (LCR) and Bounded-Stage Reachability (BSR), two variants of the safety verification problem for shared memory concurrent programs. For both problems, the memory is a single variable over a finite data domain. Our contributions are new verification algorithms and lower bounds. The latter are based on the Exponential Time Hypothesis (ETH), the problem Set Cover, and cross-compositions. LCR is the question whether a designated leader thread can reach an unsafe state when interacting with a certain number of equal contributor threads. We suggest two parameterizations: (1) By the size of the data domain D and the size of the leader L, and (2) by the size of the contributors C. We present algorithms for both cases. The key techniques are compact witnesses and dynamic programming. The algorithms run in O*((L(D+1))^(LD) * D^D) and O*(2^C) time, showing that both parameterizations are fixed-parameter tractable. We complement the upper bounds by (matching) lower bounds based on ETH and Set Cover. Moreover, we prove the absence of polynomial kernels. For BSR, we consider programs involving t different threads. We restrict the analysis to computations where the write permission changes s times between the threads. BSR asks whether a given configuration is reachable via such an s-stage computation. When parameterized by P, the maximum size of a thread, and t, the interesting observation is that the problem has a large number of difficult instances. Formally, we show that there is no polynomial kernel, no compression algorithm that reduces the size of the data domain D or the number of stages s to a polynomial dependence on P and t. This indicates that symbolic methods may be harder to find for this problem.

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

↑