论有界语境转换的复杂性
On the Complexity of Bounded Context Switching
摘要:
有界上下文切换(BCS)是一种用于发现共享内存并发程序中违反安全属性的欠近似方法。从技术上讲,BCS是一个已知为NP完全的可达性问题。我们的贡献是BCS的参数化分析。第一个结果是一个算法,当通过上下文切换的数量(cs)和内存大小(m)参数化时,该算法在O*(m^(cs)2^(cs))中求解BCS。这是通过创建更简单的问题Shuff的实例来实现的,我们通过快速子集卷积来解决该问题。基于指数时间假设,我们还提出了BCS的形式m^o(cs / log(cs))的下界。有趣的是,缩小差距意味着解决一个自FOCS'07以来一直开放的猜想。此外,我们证明了BCS承认没有多项式核。接下来,我们引入一个称为调度维度的度量,它可以捕获调度的复杂性。我们研究了调度维(sdim)参数化的BCS,并表明它可以在O*((2 m)^(4sdim)4^t)$,其中t是线程的数量。我们考虑的问题,我们获得(匹配)的上限和下限的变种。
英文摘要:
Bounded context switching (BCS) is an under-approximate method for finding violations to safety properties in shared memory concurrent programs. Technically, BCS is a reachability problem that is known to be NP-complete. Our contribution is a parameterized analysis of BCS. The first result is an algorithm that solves BCS when parameterized by the number of context switches (cs) and the size of the memory (m) in O*(m^(cs)2^(cs)). This is achieved by creating instances of the easier problem Shuff which we solve via fast subset convolution. We also present a lower bound for BCS of the form m^o(cs / log(cs)), based on the exponential time hypothesis. Interestingly, closing the gap means settling a conjecture that has been open since FOCS'07. Further, we prove that BCS admits no polynomial kernel. Next, we introduce a measure, called scheduling dimension, that captures the complexity of schedules. We study BCS parameterized by the scheduling dimension (sdim) and show that it can be solved in O*((2m)^(4sdim)4^t)$, where t is the number of threads. We consider variants of the problem for which we obtain (matching) upper and lower bounds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。