Automatic Fence Insertion in Integer Programs via Predicate Abstraction
Automatic Fence Insertion in Integer Programs via Predicate Abstraction
复制标题
DOI：
10.1007/978-3-642-33125-1_13
复制
发表时间：
2012-09
期刊：
影响因子：
--
通讯作者：
P. Abdulla;M. Atig;Yu-Fang Chen;C. Leonardsson;Ahmed Rezine
中科院分区：
文献类型：
--
作者：
P. Abdulla;M. Atig;Yu-Fang Chen;C. Leonardsson;Ahmed Rezine
We propose an automatic fence insertion and verification framework for concurrent programs running under relaxed memory. Unlike previous approaches to this problem, which allow only variables of finite domain, we target programs with (unbounded) integer variables. The problem is difficult because it has two different sources of infiniteness: unbounded store buffers and unbounded integer variables. Our framework consists of three main components: (1) a finite abstraction technique for the store buffers, (2) a finite abstraction technique for the integer variables, and (3) a counterexample guided abstraction refinement loop of the model obtained from the combination of the two abstraction techniques. We have implemented a prototype based on the framework and run it successfully on all standard benchmarks together with several challenging examples that are beyond the applicability of existing methods.
