Proving Termination of C Programs with Lists

Jera Hensel, Jürgen Giesl

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment