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.
Parameterized safety verification of round-based shared-memory systems
我们考虑分布式算法的参数化验证问题,其目标是开发技术来证明给定算法的正确性,而不管参与进程的数量。受异步二进制共识算法的启发[J. Aspnes,Fast deterministic consensus in a noisy environment. Journal of Algorithms,2002],我们考虑了基于轮的分布式算法与共享内存通信。这些系统中的一个特殊挑战是:1)进程的数量是无限的,更重要的是,2)每一轮都有一组新的寄存器。因此,验证算法需要管理两个无穷大的来源。在这种情况下,我们证明了安全验证问题,其中包括在决定是否所有可能的执行避免给定的错误状态,是PSPACE完整的。对于安全验证问题的负实例,我们还提供了指数下限和上限的最小数目的过程中所需的错误执行和最小轮上的错误状态可以覆盖。
Formal Verification of Safety Architectures for Automated Driving
National Institute of Informatics(国立信息学研究所);National Institute of Advanced Industrial Science and Technology (AIST)(国立先进工业科学技术研究院(AIST));Japanese-French Laboratory for Informatics(日法信息学实验室);The Graduate University for Advanced Studies (SOKENDAI)(综合研究大学院大学(SOKENDAI))
Convex-Analytic View of Query Selection for Safety Verification of Markov Decision Processes
The Institute of Statistical Mathematics(统计数学研究所);Tohoku University(东北大学);RIKEN AIP(理化学研究所人工智能中心);CyberAgent;National Institute of Informatics(信息学国立研究所)