Ströder, T; Giesl, J; Brockschmidt, M; Frohn, F; Fuhs, C; Hensel, J; Schneider-Kamp, P; (2014) Proving Termination and Memory Safety for Programs with Pointer Arithmetic. In: Demri, S and Kapur, D and Weidenbach, C, (eds.) Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings. (pp. 208 - 223). Springer International Publishing

Preview

PDF IJCAR14-llvm-pointer.pdf Available under License : See the attached licence file. Download (470kB)

Abstract

Proving termination automatically for programs with explicit pointer arithmetic is 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 represents all possible runs of the 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.

Download activity - last month

Export as JSONXMLCSV

Download activity - last 12 months

Export as JSONXMLCSV

Downloads by country - last 12 months

Export as JSONCSVXML

Archive Staff Only

View Item