Property Oriented Verification Via Iterative Abstract Interpretation

Static analysis by abstract interpretation is one of the widely used automatic approaches to program verification, due to its soundness guarantee and scalability. A key challenge for abstract interpretation with convex and linear abstract domain is verifying complex programs with disjunctive or non-linear behaviors. Our approach is conducting abstract interpretation in an iterative forward and backward manner. It utilizes dynamic input space partitioning to split the input space into sub-spaces. Thus each sub-space involves fewer disjunctive and non-linear program behaviors and is easier to be verified. We have implemented our approach. The experimental results are promising.