Proving Termination of C Programs with Lists

Lecture notes in computer science, pp. 266–285

Abstract

Abstract There are many techniques and tools to prove termination of 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 programs (with memory allocation and explicit pointer arithmetic) to lists.

Authors 2

1. Jera Hensel corresponding Aachen LuFG Informatik 2

   RWTH Aachen University

   Affiliation as printed

   LuFG Informatik 2, RWTH Aachen University, Aachen, Germany

2. Jürgen Giesl corresponding Aachen LuFG Informatik 2

   RWTH Aachen University

   Affiliation as printed

   LuFG Informatik 2, RWTH Aachen University, Aachen, Germany