Proving Termination of C Programs with Lists

05/20/2023
by   Jera Hensel, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2023

Automated Termination Proofs for C Programs with Lists (Short WST Version)

There are many techniques and tools for termination of C programs, but u...
research
02/05/2023

AProVE: Modular Termination Analysis of Memory-Manipulating C Programs

Termination analysis of C programs is a challenging task. On the one han...
research
07/20/2022

A Totally Predictable Outcome: An Investigation of Traversals of Infinite Structures

Functors with an instance of the Traversable type class can be thought o...
research
05/31/2021

An Automated Approach to the Collatz Conjecture

We explore the Collatz conjecture and its variants through the lens of t...
research
12/02/2020

Making Weak Memory Models Fair

We observe that the standard notion of thread fairness is insufficient f...
research
07/27/2021

The Probabilistic Termination Tool Amber

We describe the Amber tool for proving and refuting the termination of a...
research
07/27/2023

A Verified Efficient Implementation of the Weighted Path Order

The Weighted Path Order of Yamada is a powerful technique for proving te...

Please sign up or login with your details

Forgot password? Click here to reset