论文标题
用于测试多线程程序的符号部分执行
Symbolic Partial-Order Execution for Testing Multi-Threaded Programs
论文作者
论文摘要
我们描述了一种用于系统测试多线程程序的技术。我们结合了准最佳部分减少，这是一种最先进的技术，该技术通过交织非确定性而解决路径爆炸，以及符号执行，以处理数据非确定性。我们的技术迭代和详尽地找到了程序的所有执行。它代表使用部分订单执行程序，并使用基础展开的语义找到下一个执行。我们避免使用截止事件探索冗余程序跟踪。我们将技术作为KLEE的扩展而实施，并在一组大型多线程C程序中对其进行了评估。我们的实验发现了一些以前未被发现的错误和gnu和GNU排序中未定义的行为，这表明该新方法能够在工业大小的基准中找到错误。
We describe a technique for systematic testing of multi-threaded programs. We combine Quasi-Optimal Partial-Order Reduction, a state-of-the-art technique that tackles path explosion due to interleaving non-determinism, with symbolic execution to handle data non-determinism. Our technique iteratively and exhaustively finds all executions of the program. It represents program executions using partial orders and finds the next execution using an underlying unfolding semantics. We avoid the exploration of redundant program traces using cutoff events. We implemented our technique as an extension of KLEE and evaluated it on a set of large multi-threaded C programs. Our experiments found several previously undiscovered bugs and undefined behaviors in memcached and GNU sort, showing that the new method is capable of finding bugs in industrial-size benchmarks.
