Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic

作者：Stroeder Thomas; Giesl Juergen^*; Brockschmidt Marc; Frohn Florian; Fuhs Carsten; Hensel Jera; Schneider Kamp Peter; Aschermann Cornelius

来源：Journal of Automated Reasoning, 2017, 58(1): 33-65.

DOI：10.1007/s10817-016-9389-x

• LLVM
• C programs
• Termination
• Memory Safety
• Symbolic Execution

While automated verification of imperative programs has been studied intensively, proving termination of programs with explicit pointer arithmetic fully automatically was still an open problem. To close this gap, we introduce a novel abstract domain that can track allocated memory in detail. We use it to automatically construct a symbolic execution graph that over-approximates all possible runs of a program and that can be used to prove memory safety. This graph is then transformed into an integer transition system, whose termination can be proved by standard techniques. We implemented this approach in the automated termination prover AProVE and demonstrate its capability of analyzing C programs with pointer arithmetic that existing tools cannot handle.

• 出版日期2017-1
• 单位Microsoft