On the complexity of flow-sensitive dataflow analyses
DOI10.1145/325694.325704zbMath1323.68413OpenAlexW2019514379MaRDI QIDQ5178843
Publication date: 17 March 2015
Published in: Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/325694.325704
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
This page was built for publication: On the complexity of flow-sensitive dataflow analyses