arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.01955cs.PL
收藏

利用调度约束实现并发程序的安全执行

Safe Execution of Concurrent Programs by Enforcement of Scheduling Constraints

Patrick Metzler, Habib Saissi, Péter Bokor, Neeraj Suri

摘要:

并发程序的自动化软件验证是具有挑战性的,因为相对于线程的数量和每个线程的事件的数量呈指数级大的状态空间。诸如模型检验之类的验证技术需要探索在非确定性调度器下可能的大量可能执行。状态空间约简技术,如偏序约简,简化了验证问题,然而,减少的状态空间可能仍然是指数级大和棘手的。本文讨论了\emph{Iteratively Relaxed Scheduling},一个框架,使用调度约束,以简化验证问题,使自动验证程序,不能处理完全不确定性调度。程序执行是安全的,只要在程序已被验证的情况下实施相同的调度约束,例如,通过用附加的同步来检测程序。由于严格执行调度约束可能会导致很高的执行时间开销,我们提出了一个天真的解决方案,减少这种开销的优化。我们的评估的原型实现知名的基准程序显示的效果调度约束的执行时间开销,以及如何通过放松和选择约束,可以减少这种开销。

英文摘要:

Automated software verification of concurrent programs is challenging because of exponentially large state spaces with respect to the number of threads and number of events per thread. Verification techniques such as model checking need to explore a large number of possible executions that are possible under a non-deterministic scheduler. State space reduction techniques such as partial order reduction simplify the verification problem, however, the reduced state space may still be exponentially large and intractable. This paper discusses \emph{Iteratively Relaxed Scheduling}, a framework that uses scheduling constraints in order to simplify the verification problem and enable automated verification of programs which could not be handled with fully non-deterministic scheduling. Program executions are safe as long as the same scheduling constraints are enforced under which the program has been verified, e.g., by instrumenting a program with additional synchronization. As strict enforcement of scheduling constraints may induce a high execution time overhead, we present optimizations over a naive solution that reduce this overhead. Our evaluation of a prototype implementation on well-known benchmark programs shows the effect of scheduling constraints on the execution time overhead and how this overhead can be reduced by relaxing and choosing constraints.

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

↑