info
Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Termination Analysis without the Tears (by Shaowei Zhu and Zachary Kincaid)
1 view
Skip to first unread message
olcott
Oct 26, 2022, 2:54:49 PM10/26/22
to
Determining whether a given program terminates is the
quintessential undecidable problem...
Conceptually, our method proves that a program terminates by computing a
transition formula for each loop that over-approximates the behavior of
its body, and then proving that the corresponding relation admits no
infinite sequences...
An efficient algorithm for computing an 𝜔-regular expression that
recognizes the infinite paths through a control flow graph, which forms
the algorithmic foundation of our program analysis framework.
https://dl.acm.org/doi/pdf/10.1145/3453483.3454110
--
Copyright 2022 Pete Olcott
"Talent hits a target no one else can hit;
Genius hits a target no one else can see."
Arthur Schopenhauer
quintessential undecidable problem...
Conceptually, our method proves that a program terminates by computing a
transition formula for each loop that over-approximates the behavior of
its body, and then proving that the corresponding relation admits no
infinite sequences...
An efficient algorithm for computing an 𝜔-regular expression that
recognizes the infinite paths through a control flow graph, which forms
the algorithmic foundation of our program analysis framework.
https://dl.acm.org/doi/pdf/10.1145/3453483.3454110
--
Copyright 2022 Pete Olcott
"Talent hits a target no one else can hit;
Genius hits a target no one else can see."
Arthur Schopenhauer
0 new messages