@conference {19584,
	title = {Deciding kCFA is Complete for EXPTIME},
	booktitle = {ICFP {\textquoteright}08 Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming},
	series = {ICFP {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {275 - 282},
	publisher = {ACM},
	organization = {ACM},
	abstract = {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.},
	keywords = {complexity, flow analysis},
	isbn = {978-1-59593-919-7},
	url = {http://doi.acm.org/10.1145/1411204.1411243},
	author = {David Van Horn and Mairson, Harry G.}
}
