Deciding kCFA is Complete for EXPTIME
|Title||Deciding kCFA is Complete for EXPTIME|
|Publication Type||Conference Papers|
|Year of Publication||2008|
|Authors||Van Horn D, Mairson HG|
|Conference Name||ICFP '08 Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming|
|Keywords||complexity, 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.