  There are many techniques and tools for termination of C programs, but up to
now they were not very powerful for 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.
