2023
DOI: 10.1007/978-3-031-38499-8_16
|View full text |Cite
|
Sign up to set email alerts
|

Proving Termination of C Programs with Lists

Jera Hensel,
Jürgen Giesl

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 21 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?