Automated Termination Proofs for C Programs with Lists (Short WST Version)
Logic in Computer Science
2023-07-21 v1
Abstract
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.
Cite
@article{arxiv.2307.11024,
title = {Automated Termination Proofs for C Programs with Lists (Short WST Version)},
author = {Jera Hensel and Jürgen Giesl},
journal= {arXiv preprint arXiv:2307.11024},
year = {2023}
}
Comments
Presented at WST 2023, short version of arXiv:2305.12159