Resolving and Exploiting the $k$-CFA Paradox — mentioned by DannyBee

Thu, 13 Mar 2025 20:41:53 GMT

Yes, the time complexity of m-cfa is polynomial. See https://arxiv.org/pdf/1311.4231 I'll borrow a few choice pieces from the paper to try to explain why. The main difference is that: k-cfa is sensitive to the last k calls. m-cfa is sensitive to the top m stack frames. This turns out not equivalent: with k=1 vs m=1: a program where main calls a calls b. in k-cfa, the context will be the call to b. in m-cfa, the context will be the call to a. How m-cfa came about and why it works: k-CFA is EXPTIME-complete (so no polynomial algorithm can exist). However, it was observed that there are plenty…

Paper and discussion history. A mention is not an endorsement.

Resolving and Exploiting the $k$-CFA Paradox · HackerPapers discussions

Resolving and Exploiting the $k$-CFA Paradox — mentioned by DannyBee