Simplify Array Processing Loops for Efficient Program Verification

Abstract

Verification of large array programs is a major challenge for current program verification techniques due to large state spaces. Traditional methods such as bounded model checking often run out of time when verifying large array programs. To overcome the state explosion problem in the analysis of array programs, this paper proposes to simplify array processing loops for efficient program verification. For each array processing loop in an array program, we present a static analysis method to obtain a simplified loop for construction of a simplified program. The property checking of the simplified program can be used to approximate the original property. To evaluate the effectiveness and soundness, we implemented a tool based on our approach and tested it on SV-COMP 2019 benchmarks. The experimental results show that our method can successfully verify most program and achieve a high precision and effectiveness.