Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic

Thomas Ströder, Jürgen Giesl*, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann

*Kontaktforfatter for dette arbejde

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

163 Downloads (Pure)

Abstrakt

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.

OriginalsprogEngelsk
TidsskriftJournal of Automated Reasoning
Vol/bind58
Udgave nummer1
Sider (fra-til)33-65
ISSN0168-7433
DOI
StatusUdgivet - 2017

Fingeraftryk Dyk ned i forskningsemnerne om 'Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic'. Sammen danner de et unikt fingeraftryk.

Citationsformater