A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
From Shape Analysis to Termination Analysis in Linear Time
[chapter]
2016
Lecture Notes in Computer Science
We present a novel algorithm to conservatively check whether a (recursive) heap-manipulating program terminates. Our algorithm can be used as a post-processing phase of any shape analysis satisfying some natural properties. The running time of the post-processing phase is linear in the size of the output of the chosen shape analysis. The main idea is to partition the (unbounded but finite) set of allocated objects in every state into a bounded set of regions, and track the flow of objects
doi:10.1007/978-3-319-41528-4_23
fatcat:hhr5skypnnabhkutmxoxbnpkxi