The Complexity of Flow Analysis in Higher-Order Languages
Usually printed in 3 - 5 business days
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.
Details
- Publication Date
- Nov 19, 2013
- Language
- English
- ISBN
- 9781304637833
- Category
- Computers & Technology
- Copyright
- All Rights Reserved - Standard Copyright License
- Contributors
- By (author): David Van Horn
Specifications
- Pages
- 164
- Binding
- Perfect Bound
- Interior Color
- Black & White
- Dimensions
- US Letter (8.5 x 11 in / 216 x 279 mm)