Deciding $k$CFA is complete for EXPTIME
Programming Languages
2013-11-25 v1
Abstract
We give an exact characterization of the computational complexity of the CFA hierarchy. For any , 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.
Cite
@article{arxiv.1311.5810,
title = {Deciding $k$CFA is complete for EXPTIME},
author = {David Van Horn and Harry G. Mairson},
journal= {arXiv preprint arXiv:1311.5810},
year = {2013}
}
Comments
Appeared in The 13th ACM SIGPLAN International Conference on Functional Programming (ICFP'08), Victoria, British Columbia, Canada, September 2008