Deciding kCFA is Complete for EXPTIME

TitleDeciding kCFA is Complete for EXPTIME
Publication TypeConference Papers
Year of Publication2008
AuthorsVan Horn D, Mairson HG
Conference NameICFP '08 Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming
Date Published2008///
ISBN Number978-1-59593-919-7
Keywordscomplexity, flow analysis

We give an exact characterization of the computational complexity of the kCFA hierarchy. For any k > 0, we prove that the control flow decision problem is complete for deterministic exponential time. This theorem validates empirical observations that such control flow analysis is intractable. It also provides more general insight into the complexity of abstract interpretation.