[BOOK][B] The complexity of flow analysis in higher-order languages
D Van Horn - 2009 - search.proquest.com
2009•search.proquest.com
This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis
problems in higher-order programming languages. We give exact characterizations of the
computational complexity of 0CFA, the kCFA hierarchy, and related analyses. In each case,
we precisely capture both the expressiveness and feasibility of the analysis, identifying the
elements responsible for the trade-off.
problems in higher-order programming languages. We give exact characterizations of the
computational complexity of 0CFA, the kCFA hierarchy, and related analyses. In each case,
we precisely capture both the expressiveness and feasibility of the analysis, identifying the
elements responsible for the trade-off.
Abstract
This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis problems in higher-order programming languages. We give exact characterizations of the computational complexity of 0CFA, the kCFA hierarchy, and related analyses. In each case, we precisely capture both the expressiveness and feasibility of the analysis, identifying the elements responsible for the trade-off.
ProQuestShowing the best result for this search. See all results