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

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

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2023

Proving Termination of C Programs with Lists

There are many techniques and tools to prove termination of C programs, ...
research
05/13/2021

Circular Proofs as Processes: Type-Based Termination via Arithmetic Refinements

Type systems for concurrent programs guarantee such desirable properties...
research
03/02/2019

2LS: Heap Analysis and Memory Safety (Competition Contribution)

2LS is a framework for analysis of sequential C programs that can verify...
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...
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
06/13/2018

TTT2 with Termination Templates for Teaching

On the one hand, checking specific termination proofs by hand, say using...
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...

Please sign up or login with your details

Forgot password? Click here to reset