Deciding k CFA is complete for EXPTIME

DOI10.1145/1411204.1411243zbMath1323.68309arXiv1311.5810OpenAlexW2953089209MaRDI QIDQ5178768

David A. Vanhorn, Harry G. Mairson

Publication date: 16 March 2015

Published in: Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.5810

zbMATH Keywords

complexityflow analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Abstract allocation as a unified approach to polyvariance in control-flow analyses

This page was built for publication: Deciding k CFA is complete for EXPTIME