Proving Termination of C Programs with Lists

RWTH Publications (RWTH Aachen)

Abstract

There are many techniques and tools to prove termination of C programs, but up to now these tools were not very powerful for fully automated termination proofs of programs whose termination depends on recursive data structures like lists. We present the first approach that extends powerful techniques for termination analysis of C programs (with memory allocation and explicit pointer arithmetic) to lists.

Authors 2

1. Jera Hensel Aachen Informatik 2

   RWTH Aachen University

   Affiliation as printed

   Informatik 2 , RWTH Aachen University , Germany

2. Jürgen Giesl